./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-58.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f1f964f933f97d84a1068e8591813edbcbebaf3126218889391821aea3df0be5 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:10:25,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:10:25,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:10:25,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:10:25,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:10:25,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:10:25,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:10:25,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:10:25,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:10:25,734 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:10:25,735 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:10:25,735 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:10:25,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:10:25,736 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:10:25,736 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:10:25,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:10:25,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:10:25,740 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:10:25,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:10:25,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:10:25,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:10:25,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:10:25,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:10:25,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:10:25,742 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:10:25,742 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:10:25,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:10:25,743 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:10:25,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:10:25,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:10:25,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:10:25,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:10:25,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:10:25,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:10:25,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:10:25,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:10:25,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:10:25,745 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:10:25,745 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:10:25,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:10:25,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:10:25,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:10:25,748 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f1f964f933f97d84a1068e8591813edbcbebaf3126218889391821aea3df0be5 [2024-11-08 20:10:26,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:10:26,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:10:26,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:10:26,050 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:10:26,051 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:10:26,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-58.i [2024-11-08 20:10:27,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:10:27,858 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:10:27,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-58.i [2024-11-08 20:10:27,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c2f208f/3944104ad31044f69889d558be259129/FLAG46668e03a [2024-11-08 20:10:27,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/43c2f208f/3944104ad31044f69889d558be259129 [2024-11-08 20:10:27,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:10:27,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:10:27,897 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:10:27,897 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:10:27,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:10:27,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:10:27" (1/1) ... [2024-11-08 20:10:27,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f7fb9cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:10:27, skipping insertion in model container [2024-11-08 20:10:27,906 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:10:27" (1/1) ... [2024-11-08 20:10:27,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:10:28,140 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-58.i[916,929] [2024-11-08 20:10:28,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:10:28,243 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:10:28,253 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-58.i[916,929] [2024-11-08 20:10:28,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:10:28,315 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:10:28,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:10:28 WrapperNode [2024-11-08 20:10:28,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:10:28,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:10:28,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:10:28,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:10:28,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:10:28" (1/1) ... [2024-11-08 20:10:28,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:10:28" (1/1) ... [2024-11-08 20:10:28,414 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 311 [2024-11-08 20:10:28,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:10:28,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:10:28,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:10:28,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:10:28,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:10:28" (1/1) ... [2024-11-08 20:10:28,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:10:28" (1/1) ... [2024-11-08 20:10:28,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:10:28" (1/1) ... [2024-11-08 20:10:28,470 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:10:28,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:10:28" (1/1) ... [2024-11-08 20:10:28,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:10:28" (1/1) ... [2024-11-08 20:10:28,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:10:28" (1/1) ... [2024-11-08 20:10:28,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:10:28" (1/1) ... [2024-11-08 20:10:28,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:10:28" (1/1) ... [2024-11-08 20:10:28,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:10:28" (1/1) ... [2024-11-08 20:10:28,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:10:28,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:10:28,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:10:28,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:10:28,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:10:28" (1/1) ... [2024-11-08 20:10:28,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:10:28,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:10:28,550 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:10:28,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:10:28,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:10:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:10:28,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:10:28,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:10:28,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:10:28,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:10:28,727 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:10:28,730 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:10:29,417 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 20:10:29,417 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:10:29,437 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:10:29,439 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:10:29,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:10:29 BoogieIcfgContainer [2024-11-08 20:10:29,440 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:10:29,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:10:29,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:10:29,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:10:29,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:10:27" (1/3) ... [2024-11-08 20:10:29,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640d1027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:10:29, skipping insertion in model container [2024-11-08 20:10:29,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:10:28" (2/3) ... [2024-11-08 20:10:29,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640d1027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:10:29, skipping insertion in model container [2024-11-08 20:10:29,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:10:29" (3/3) ... [2024-11-08 20:10:29,449 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-58.i [2024-11-08 20:10:29,463 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:10:29,464 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:10:29,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:10:29,542 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6abda1e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:10:29,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:10:29,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 20:10:29,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-08 20:10:29,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:10:29,574 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:10:29,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:10:29,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:10:29,581 INFO L85 PathProgramCache]: Analyzing trace with hash 878136670, now seen corresponding path program 1 times [2024-11-08 20:10:29,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:10:29,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074952704] [2024-11-08 20:10:29,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:10:29,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:10:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:10:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:10:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 20:10:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:10:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:10:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:10:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:10:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:10:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:10:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:10:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:10:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:10:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:10:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:10:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:10:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:10:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 20:10:30,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:10:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 20:10:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 20:10:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 20:10:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:10:30,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 20:10:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:10:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:10:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 20:10:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:10:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 20:10:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 20:10:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 20:10:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 20:10:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:10:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-08 20:10:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-08 20:10:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-08 20:10:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-08 20:10:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-08 20:10:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 20:10:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-08 20:10:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-08 20:10:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-08 20:10:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-08 20:10:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-08 20:10:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-08 20:10:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-08 20:10:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-08 20:10:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-08 20:10:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-08 20:10:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-08 20:10:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-08 20:10:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-08 20:10:30,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:10:30,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074952704] [2024-11-08 20:10:30,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074952704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:10:30,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:10:30,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:10:30,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809172415] [2024-11-08 20:10:30,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:10:30,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:10:30,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:10:30,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:10:30,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:10:30,479 INFO L87 Difference]: Start difference. First operand has 136 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-08 20:10:30,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:10:30,539 INFO L93 Difference]: Finished difference Result 265 states and 486 transitions. [2024-11-08 20:10:30,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:10:30,541 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 309 [2024-11-08 20:10:30,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:10:30,555 INFO L225 Difference]: With dead ends: 265 [2024-11-08 20:10:30,555 INFO L226 Difference]: Without dead ends: 132 [2024-11-08 20:10:30,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:10:30,569 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:10:30,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:10:30,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-08 20:10:30,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-08 20:10:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 80 states have (on average 1.425) internal successors, (114), 80 states have internal predecessors, (114), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 20:10:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 214 transitions. [2024-11-08 20:10:30,649 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 214 transitions. Word has length 309 [2024-11-08 20:10:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:10:30,650 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 214 transitions. [2024-11-08 20:10:30,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-08 20:10:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 214 transitions. [2024-11-08 20:10:30,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-08 20:10:30,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:10:30,661 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:10:30,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:10:30,662 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:10:30,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:10:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1291888474, now seen corresponding path program 1 times [2024-11-08 20:10:30,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:10:30,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469806618] [2024-11-08 20:10:30,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:10:30,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:10:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:10:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:10:31,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 20:10:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:10:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-08 20:10:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:10:31,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 20:10:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:10:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 20:10:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:10:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 20:10:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:10:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 20:10:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:10:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 20:10:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:10:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 20:10:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 20:10:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 20:10:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 20:10:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 20:10:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:10:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 20:10:31,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:10:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:10:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 20:10:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 20:10:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 20:10:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-08 20:10:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-08 20:10:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 20:10:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 20:10:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-08 20:10:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-08 20:10:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-11-08 20:10:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-08 20:10:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-08 20:10:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 20:10:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-11-08 20:10:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-08 20:10:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-11-08 20:10:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-11-08 20:10:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-08 20:10:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-08 20:10:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-08 20:10:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-08 20:10:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-08 20:10:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-08 20:10:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-08 20:10:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-08 20:10:31,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:10:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-08 20:10:31,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:10:31,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469806618] [2024-11-08 20:10:31,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469806618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:10:31,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:10:31,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:10:31,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031742755] [2024-11-08 20:10:31,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:10:31,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:10:31,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:10:31,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:10:31,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:10:31,478 INFO L87 Difference]: Start difference. First operand 132 states and 214 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-08 20:10:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:10:32,029 INFO L93 Difference]: Finished difference Result 485 states and 780 transitions. [2024-11-08 20:10:32,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:10:32,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 309 [2024-11-08 20:10:32,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:10:32,035 INFO L225 Difference]: With dead ends: 485 [2024-11-08 20:10:32,035 INFO L226 Difference]: Without dead ends: 356 [2024-11-08 20:10:32,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:10:32,038 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 368 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:10:32,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 732 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 20:10:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-08 20:10:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 347. [2024-11-08 20:10:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 216 states have (on average 1.4351851851851851) internal successors, (310), 219 states have internal predecessors, (310), 126 states have call successors, (126), 4 states have call predecessors, (126), 4 states have return successors, (126), 123 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-08 20:10:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 562 transitions. [2024-11-08 20:10:32,110 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 562 transitions. Word has length 309 [2024-11-08 20:10:32,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:10:32,112 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 562 transitions. [2024-11-08 20:10:32,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-08 20:10:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 562 transitions. [2024-11-08 20:10:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-08 20:10:32,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:10:32,117 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:10:32,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:10:32,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:10:32,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:10:32,118 INFO L85 PathProgramCache]: Analyzing trace with hash 12024796, now seen corresponding path program 1 times [2024-11-08 20:10:32,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:10:32,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13974034] [2024-11-08 20:10:32,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:10:32,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:10:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat