./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_operatoramount_amount50_file-66.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 46dcd3bee3e07f84df18611ceb0a68103be2f6eabf5254259333ed4c471ba4e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:56:59,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:56:59,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:56:59,345 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:56:59,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:56:59,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:56:59,364 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:56:59,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:56:59,365 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:56:59,365 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:56:59,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:56:59,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:56:59,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:56:59,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:56:59,365 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:56:59,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:56:59,366 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:56:59,366 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:56:59,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:56:59,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:56:59,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:56:59,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:56:59,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:56:59,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:56:59,366 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:56:59,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:56:59,366 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:56:59,366 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:56:59,366 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:56:59,367 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:56:59,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:56:59,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:56:59,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:56:59,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:56:59,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:56:59,367 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:56:59,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:56:59,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:56:59,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:56:59,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:56:59,367 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:56:59,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:56:59,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:56:59,368 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 46dcd3bee3e07f84df18611ceb0a68103be2f6eabf5254259333ed4c471ba4e1 [2025-03-08 15:56:59,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:56:59,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:56:59,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:56:59,612 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:56:59,612 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:56:59,614 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i [2025-03-08 15:57:00,702 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b72d7a89/abf1ef6b3af5402db9abf399a9b7b545/FLAGa5f42bed9 [2025-03-08 15:57:00,918 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:57:00,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i [2025-03-08 15:57:00,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b72d7a89/abf1ef6b3af5402db9abf399a9b7b545/FLAGa5f42bed9 [2025-03-08 15:57:01,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b72d7a89/abf1ef6b3af5402db9abf399a9b7b545 [2025-03-08 15:57:01,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:57:01,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:57:01,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:57:01,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:57:01,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:57:01,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:57:01" (1/1) ... [2025-03-08 15:57:01,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@baf7e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:57:01, skipping insertion in model container [2025-03-08 15:57:01,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:57:01" (1/1) ... [2025-03-08 15:57:01,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:57:01,387 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_operatoramount_amount50_file-66.i[915,928] [2025-03-08 15:57:01,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:57:01,451 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:57:01,459 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_operatoramount_amount50_file-66.i[915,928] [2025-03-08 15:57:01,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:57:01,502 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:57:01,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:57:01 WrapperNode [2025-03-08 15:57:01,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:57:01,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:57:01,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:57:01,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:57:01,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:57:01" (1/1) ... [2025-03-08 15:57:01,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:57:01" (1/1) ... [2025-03-08 15:57:01,553 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2025-03-08 15:57:01,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:57:01,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:57:01,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:57:01,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:57:01,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:57:01" (1/1) ... [2025-03-08 15:57:01,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:57:01" (1/1) ... [2025-03-08 15:57:01,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:57:01" (1/1) ... [2025-03-08 15:57:01,579 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]. [2025-03-08 15:57:01,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:57:01" (1/1) ... [2025-03-08 15:57:01,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:57:01" (1/1) ... [2025-03-08 15:57:01,583 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:57:01" (1/1) ... [2025-03-08 15:57:01,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:57:01" (1/1) ... [2025-03-08 15:57:01,589 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:57:01" (1/1) ... [2025-03-08 15:57:01,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:57:01" (1/1) ... [2025-03-08 15:57:01,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:57:01,596 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:57:01,599 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:57:01,599 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:57:01,600 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:57:01" (1/1) ... [2025-03-08 15:57:01,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:57:01,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:57:01,621 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) [2025-03-08 15:57:01,623 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 [2025-03-08 15:57:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:57:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:57:01,638 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:57:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:57:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:57:01,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:57:01,696 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:57:01,698 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:57:01,931 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 15:57:01,931 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:57:01,940 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:57:01,940 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:57:01,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:57:01 BoogieIcfgContainer [2025-03-08 15:57:01,940 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:57:01,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:57:01,942 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:57:01,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:57:01,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:57:01" (1/3) ... [2025-03-08 15:57:01,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf57006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:57:01, skipping insertion in model container [2025-03-08 15:57:01,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:57:01" (2/3) ... [2025-03-08 15:57:01,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf57006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:57:01, skipping insertion in model container [2025-03-08 15:57:01,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:57:01" (3/3) ... [2025-03-08 15:57:01,946 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-66.i [2025-03-08 15:57:01,958 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:57:01,959 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-66.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:57:02,008 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:57:02,015 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;@4d8d48bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:57:02,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:57:02,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 15:57:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 15:57:02,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:57:02,029 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:57:02,029 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:57:02,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:57:02,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2140051745, now seen corresponding path program 1 times [2025-03-08 15:57:02,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:57:02,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524773100] [2025-03-08 15:57:02,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:57:02,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:57:02,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 15:57:02,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 15:57:02,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:57:02,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:57:02,219 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 15:57:02,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:57:02,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524773100] [2025-03-08 15:57:02,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524773100] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:57:02,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300442606] [2025-03-08 15:57:02,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:57:02,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:57:02,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:57:02,222 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:57:02,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:57:02,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 15:57:02,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 15:57:02,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:57:02,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:57:02,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:57:02,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:57:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 15:57:02,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:57:02,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300442606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:57:02,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:57:02,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:57:02,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909684035] [2025-03-08 15:57:02,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:57:02,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:57:02,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:57:02,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:57:02,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:57:02,367 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 15:57:02,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:57:02,381 INFO L93 Difference]: Finished difference Result 114 states and 195 transitions. [2025-03-08 15:57:02,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:57:02,383 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2025-03-08 15:57:02,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:57:02,388 INFO L225 Difference]: With dead ends: 114 [2025-03-08 15:57:02,388 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 15:57:02,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:57:02,394 INFO L435 NwaCegarLoop]: 86 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, 86 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 [2025-03-08 15:57:02,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:57:02,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 15:57:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-08 15:57:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 15:57:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2025-03-08 15:57:02,422 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 119 [2025-03-08 15:57:02,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:57:02,423 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2025-03-08 15:57:02,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 15:57:02,423 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2025-03-08 15:57:02,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 15:57:02,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:57:02,427 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:57:02,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:57:02,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:57:02,628 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:57:02,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:57:02,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1937578433, now seen corresponding path program 1 times [2025-03-08 15:57:02,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:57:02,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380208455] [2025-03-08 15:57:02,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:57:02,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:57:02,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 15:57:02,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 15:57:02,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:57:02,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:57:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 15:57:06,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:57:06,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380208455] [2025-03-08 15:57:06,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380208455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:57:06,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:57:06,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 15:57:06,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849836643] [2025-03-08 15:57:06,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:57:06,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 15:57:06,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:57:06,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 15:57:06,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:57:06,465 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 15:57:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:57:07,211 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2025-03-08 15:57:07,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 15:57:07,212 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-03-08 15:57:07,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:57:07,214 INFO L225 Difference]: With dead ends: 232 [2025-03-08 15:57:07,214 INFO L226 Difference]: Without dead ends: 178 [2025-03-08 15:57:07,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:57:07,215 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 238 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:57:07,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 428 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:57:07,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-08 15:57:07,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 102. [2025-03-08 15:57:07,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 15:57:07,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2025-03-08 15:57:07,229 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 119 [2025-03-08 15:57:07,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:57:07,229 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2025-03-08 15:57:07,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 15:57:07,231 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2025-03-08 15:57:07,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 15:57:07,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:57:07,233 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:57:07,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:57:07,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:57:07,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:57:07,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1938501954, now seen corresponding path program 1 times [2025-03-08 15:57:07,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:57:07,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576170493] [2025-03-08 15:57:07,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:57:07,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:57:07,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 15:57:07,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 15:57:07,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:57:07,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:57:10,433 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 15:57:10,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:57:10,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576170493] [2025-03-08 15:57:10,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576170493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:57:10,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:57:10,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 15:57:10,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674640992] [2025-03-08 15:57:10,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:57:10,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 15:57:10,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:57:10,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 15:57:10,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:57:10,434 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 15:57:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:57:11,887 INFO L93 Difference]: Finished difference Result 178 states and 242 transitions. [2025-03-08 15:57:11,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 15:57:11,888 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-03-08 15:57:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:57:11,889 INFO L225 Difference]: With dead ends: 178 [2025-03-08 15:57:11,889 INFO L226 Difference]: Without dead ends: 176 [2025-03-08 15:57:11,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-03-08 15:57:11,890 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 199 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:57:11,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 561 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:57:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-08 15:57:11,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 102. [2025-03-08 15:57:11,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 78 states have internal predecessors, (108), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 15:57:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2025-03-08 15:57:11,915 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 119 [2025-03-08 15:57:11,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:57:11,915 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2025-03-08 15:57:11,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 15:57:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2025-03-08 15:57:11,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 15:57:11,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:57:11,916 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:57:11,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:57:11,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:57:11,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:57:11,917 INFO L85 PathProgramCache]: Analyzing trace with hash 130123970, now seen corresponding path program 1 times [2025-03-08 15:57:11,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:57:11,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935817165] [2025-03-08 15:57:11,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:57:11,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:57:11,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 15:57:11,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 15:57:11,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:57:11,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:57:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 15:57:14,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:57:14,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935817165] [2025-03-08 15:57:14,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935817165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:57:14,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:57:14,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 15:57:14,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631530877] [2025-03-08 15:57:14,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:57:14,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 15:57:14,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:57:14,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 15:57:14,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:57:14,447 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 15:57:15,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:57:15,207 INFO L93 Difference]: Finished difference Result 185 states and 250 transitions. [2025-03-08 15:57:15,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 15:57:15,208 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-03-08 15:57:15,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:57:15,209 INFO L225 Difference]: With dead ends: 185 [2025-03-08 15:57:15,209 INFO L226 Difference]: Without dead ends: 183 [2025-03-08 15:57:15,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:57:15,210 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 160 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:57:15,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 557 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:57:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-08 15:57:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 106. [2025-03-08 15:57:15,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 82 states have internal predecessors, (114), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 15:57:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 158 transitions. [2025-03-08 15:57:15,219 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 158 transitions. Word has length 119 [2025-03-08 15:57:15,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:57:15,220 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 158 transitions. [2025-03-08 15:57:15,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 15:57:15,220 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 158 transitions. [2025-03-08 15:57:15,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 15:57:15,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:57:15,223 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:57:15,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:57:15,223 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:57:15,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:57:15,224 INFO L85 PathProgramCache]: Analyzing trace with hash 131047491, now seen corresponding path program 1 times [2025-03-08 15:57:15,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:57:15,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212108012] [2025-03-08 15:57:15,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:57:15,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:57:15,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 15:57:15,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 15:57:15,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:57:15,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:57:37,656 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 15:57:37,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:57:37,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212108012] [2025-03-08 15:57:37,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212108012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:57:37,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:57:37,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-08 15:57:37,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289511841] [2025-03-08 15:57:37,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:57:37,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 15:57:37,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:57:37,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 15:57:37,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:57:37,658 INFO L87 Difference]: Start difference. First operand 106 states and 158 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 15:57:39,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:57:39,316 INFO L93 Difference]: Finished difference Result 164 states and 226 transitions. [2025-03-08 15:57:39,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 15:57:39,317 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-03-08 15:57:39,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:57:39,319 INFO L225 Difference]: With dead ends: 164 [2025-03-08 15:57:39,319 INFO L226 Difference]: Without dead ends: 162 [2025-03-08 15:57:39,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2025-03-08 15:57:39,320 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 114 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:57:39,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 481 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 15:57:39,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-08 15:57:39,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 107. [2025-03-08 15:57:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 83 states have internal predecessors, (115), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 15:57:39,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2025-03-08 15:57:39,335 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 119 [2025-03-08 15:57:39,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:57:39,336 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2025-03-08 15:57:39,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 15:57:39,336 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2025-03-08 15:57:39,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 15:57:39,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:57:39,337 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:57:39,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:57:39,337 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:57:39,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:57:39,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2066661152, now seen corresponding path program 1 times [2025-03-08 15:57:39,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:57:39,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39212213] [2025-03-08 15:57:39,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:57:39,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:57:39,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 15:57:39,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 15:57:39,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:57:39,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:57:39,375 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 15:57:39,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:57:39,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39212213] [2025-03-08 15:57:39,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39212213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:57:39,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:57:39,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:57:39,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626561315] [2025-03-08 15:57:39,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:57:39,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:57:39,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:57:39,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:57:39,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:57:39,378 INFO L87 Difference]: Start difference. First operand 107 states and 159 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 15:57:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:57:39,408 INFO L93 Difference]: Finished difference Result 291 states and 436 transitions. [2025-03-08 15:57:39,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:57:39,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-03-08 15:57:39,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:57:39,411 INFO L225 Difference]: With dead ends: 291 [2025-03-08 15:57:39,411 INFO L226 Difference]: Without dead ends: 187 [2025-03-08 15:57:39,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:57:39,413 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 73 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:57:39,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 222 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:57:39,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-08 15:57:39,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2025-03-08 15:57:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 136 states have (on average 1.3308823529411764) internal successors, (181), 138 states have internal predecessors, (181), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 15:57:39,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 269 transitions. [2025-03-08 15:57:39,449 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 269 transitions. Word has length 119 [2025-03-08 15:57:39,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:57:39,449 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 269 transitions. [2025-03-08 15:57:39,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 15:57:39,449 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 269 transitions. [2025-03-08 15:57:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 15:57:39,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:57:39,451 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:57:39,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:57:39,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:57:39,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:57:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash -485495809, now seen corresponding path program 1 times [2025-03-08 15:57:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:57:39,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618895498] [2025-03-08 15:57:39,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:57:39,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:57:39,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 15:57:39,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 15:57:39,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:57:39,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:57:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 15:57:39,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:57:39,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618895498] [2025-03-08 15:57:39,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618895498] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:57:39,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:57:39,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:57:39,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844962456] [2025-03-08 15:57:39,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:57:39,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:57:39,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:57:39,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:57:39,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:57:39,511 INFO L87 Difference]: Start difference. First operand 185 states and 269 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 15:57:39,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:57:39,651 INFO L93 Difference]: Finished difference Result 540 states and 775 transitions. [2025-03-08 15:57:39,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:57:39,653 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-03-08 15:57:39,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:57:39,655 INFO L225 Difference]: With dead ends: 540 [2025-03-08 15:57:39,655 INFO L226 Difference]: Without dead ends: 358 [2025-03-08 15:57:39,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:57:39,656 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 71 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:57:39,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 263 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:57:39,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-08 15:57:39,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 313. [2025-03-08 15:57:39,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 220 states have (on average 1.3) internal successors, (286), 223 states have internal predecessors, (286), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-08 15:57:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 454 transitions. [2025-03-08 15:57:39,690 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 454 transitions. Word has length 119 [2025-03-08 15:57:39,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:57:39,690 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 454 transitions. [2025-03-08 15:57:39,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 15:57:39,690 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 454 transitions. [2025-03-08 15:57:39,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 15:57:39,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:57:39,691 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:57:39,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:57:39,691 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:57:39,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:57:39,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2002017024, now seen corresponding path program 1 times [2025-03-08 15:57:39,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:57:39,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662141186] [2025-03-08 15:57:39,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:57:39,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:57:39,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 15:57:39,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 15:57:39,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:57:39,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:57:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 15:57:41,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:57:41,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662141186] [2025-03-08 15:57:41,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662141186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:57:41,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:57:41,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 15:57:41,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450104691] [2025-03-08 15:57:41,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:57:41,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 15:57:41,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:57:41,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 15:57:41,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:57:41,225 INFO L87 Difference]: Start difference. First operand 313 states and 454 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 15:57:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:57:41,893 INFO L93 Difference]: Finished difference Result 459 states and 621 transitions. [2025-03-08 15:57:41,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 15:57:41,894 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-03-08 15:57:41,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:57:41,896 INFO L225 Difference]: With dead ends: 459 [2025-03-08 15:57:41,896 INFO L226 Difference]: Without dead ends: 457 [2025-03-08 15:57:41,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:57:41,897 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 237 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:57:41,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 516 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:57:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-08 15:57:41,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 369. [2025-03-08 15:57:41,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 265 states have (on average 1.2792452830188679) internal successors, (339), 270 states have internal predecessors, (339), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 15:57:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 523 transitions. [2025-03-08 15:57:41,939 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 523 transitions. Word has length 119 [2025-03-08 15:57:41,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:57:41,940 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 523 transitions. [2025-03-08 15:57:41,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 15:57:41,940 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 523 transitions. [2025-03-08 15:57:41,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 15:57:41,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:57:41,941 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:57:41,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:57:41,941 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:57:41,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:57:41,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2002940545, now seen corresponding path program 1 times [2025-03-08 15:57:41,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:57:41,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241365608] [2025-03-08 15:57:41,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:57:41,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:57:41,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 15:57:41,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 15:57:41,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:57:41,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:57:44,451 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 15:57:44,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:57:44,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241365608] [2025-03-08 15:57:44,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241365608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:57:44,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:57:44,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 15:57:44,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278527780] [2025-03-08 15:57:44,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:57:44,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 15:57:44,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:57:44,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 15:57:44,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-08 15:57:44,452 INFO L87 Difference]: Start difference. First operand 369 states and 523 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 15:57:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:57:45,840 INFO L93 Difference]: Finished difference Result 457 states and 619 transitions. [2025-03-08 15:57:45,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 15:57:45,842 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-03-08 15:57:45,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:57:45,844 INFO L225 Difference]: With dead ends: 457 [2025-03-08 15:57:45,844 INFO L226 Difference]: Without dead ends: 455 [2025-03-08 15:57:45,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:57:45,845 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 268 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:57:45,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 584 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 15:57:45,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-03-08 15:57:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 369. [2025-03-08 15:57:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 265 states have (on average 1.2792452830188679) internal successors, (339), 270 states have internal predecessors, (339), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-08 15:57:45,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 523 transitions. [2025-03-08 15:57:45,874 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 523 transitions. Word has length 119 [2025-03-08 15:57:45,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:57:45,874 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 523 transitions. [2025-03-08 15:57:45,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 15:57:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 523 transitions. [2025-03-08 15:57:45,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 15:57:45,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:57:45,875 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:57:45,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:57:45,875 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:57:45,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:57:45,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1644175426, now seen corresponding path program 1 times [2025-03-08 15:57:45,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:57:45,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689696734] [2025-03-08 15:57:45,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:57:45,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:57:45,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 15:57:45,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 15:57:45,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:57:45,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:57:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 15:57:46,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:57:46,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689696734] [2025-03-08 15:57:46,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689696734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:57:46,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:57:46,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:57:46,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124174617] [2025-03-08 15:57:46,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:57:46,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:57:46,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:57:46,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:57:46,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:57:46,035 INFO L87 Difference]: Start difference. First operand 369 states and 523 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 15:57:46,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:57:46,201 INFO L93 Difference]: Finished difference Result 699 states and 979 transitions. [2025-03-08 15:57:46,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:57:46,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2025-03-08 15:57:46,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:57:46,205 INFO L225 Difference]: With dead ends: 699 [2025-03-08 15:57:46,205 INFO L226 Difference]: Without dead ends: 376 [2025-03-08 15:57:46,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:57:46,206 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 125 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:57:46,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 151 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:57:46,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-08 15:57:46,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 367. [2025-03-08 15:57:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 257 states have (on average 1.2373540856031129) internal successors, (318), 262 states have internal predecessors, (318), 96 states have call successors, (96), 13 states have call predecessors, (96), 13 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-08 15:57:46,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 510 transitions. [2025-03-08 15:57:46,243 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 510 transitions. Word has length 119 [2025-03-08 15:57:46,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:57:46,244 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 510 transitions. [2025-03-08 15:57:46,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 15:57:46,245 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 510 transitions. [2025-03-08 15:57:46,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 15:57:46,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:57:46,246 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:57:46,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:57:46,247 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:57:46,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:57:46,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1109061024, now seen corresponding path program 1 times [2025-03-08 15:57:46,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:57:46,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568104791] [2025-03-08 15:57:46,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:57:46,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:57:46,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 15:57:46,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 15:57:46,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:57:46,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:57:46,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1466030503] [2025-03-08 15:57:46,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:57:46,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:57:46,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:57:46,306 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:57:46,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:57:46,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 15:57:46,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 15:57:46,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:57:46,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:57:46,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 15:57:46,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:57:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 396 proven. 102 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 15:57:47,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:58:05,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:58:05,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568104791] [2025-03-08 15:58:05,156 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 15:58:05,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466030503] [2025-03-08 15:58:05,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466030503] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:58:05,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:58:05,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2025-03-08 15:58:05,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19304238] [2025-03-08 15:58:05,158 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 15:58:05,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 15:58:05,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:58:05,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 15:58:05,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=362, Unknown=2, NotChecked=0, Total=462 [2025-03-08 15:58:05,159 INFO L87 Difference]: Start difference. First operand 367 states and 510 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (18), 6 states have call predecessors, (18), 9 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-08 15:58:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:58:08,354 INFO L93 Difference]: Finished difference Result 756 states and 966 transitions. [2025-03-08 15:58:08,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-08 15:58:08,354 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (18), 6 states have call predecessors, (18), 9 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 120 [2025-03-08 15:58:08,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:58:08,357 INFO L225 Difference]: With dead ends: 756 [2025-03-08 15:58:08,357 INFO L226 Difference]: Without dead ends: 571 [2025-03-08 15:58:08,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=399, Invalid=1405, Unknown=2, NotChecked=0, Total=1806 [2025-03-08 15:58:08,358 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 112 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:58:08,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 333 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 15:58:08,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-08 15:58:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 447. [2025-03-08 15:58:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 318 states have (on average 1.1823899371069182) internal successors, (376), 323 states have internal predecessors, (376), 94 states have call successors, (94), 34 states have call predecessors, (94), 34 states have return successors, (94), 89 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-08 15:58:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 564 transitions. [2025-03-08 15:58:08,400 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 564 transitions. Word has length 120 [2025-03-08 15:58:08,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:58:08,400 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 564 transitions. [2025-03-08 15:58:08,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 6 states have call successors, (18), 6 states have call predecessors, (18), 9 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-08 15:58:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 564 transitions. [2025-03-08 15:58:08,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 15:58:08,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:58:08,401 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:58:08,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:58:08,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 15:58:08,602 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:58:08,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:58:08,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1109984545, now seen corresponding path program 1 times [2025-03-08 15:58:08,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:58:08,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680295245] [2025-03-08 15:58:08,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:58:08,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:58:08,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 15:58:08,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 15:58:08,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:08,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:58:08,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1154521756] [2025-03-08 15:58:08,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:58:08,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:58:08,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:58:08,658 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:58:08,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:58:08,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 15:58:08,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 15:58:08,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:08,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:58:08,720 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:58:08,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 15:58:08,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 15:58:08,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:08,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:58:08,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:58:08,784 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:58:08,784 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:58:08,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 15:58:08,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:58:08,988 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:58:09,075 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:58:09,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:58:09 BoogieIcfgContainer [2025-03-08 15:58:09,077 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:58:09,078 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:58:09,078 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:58:09,078 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:58:09,078 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:57:01" (3/4) ... [2025-03-08 15:58:09,080 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:58:09,080 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:58:09,081 INFO L158 Benchmark]: Toolchain (without parser) took 67814.73ms. Allocated memory was 167.8MB in the beginning and 847.2MB in the end (delta: 679.5MB). Free memory was 124.3MB in the beginning and 798.9MB in the end (delta: -674.6MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2025-03-08 15:58:09,082 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:58:09,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.35ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 111.0MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:58:09,082 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.76ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 108.1MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:58:09,082 INFO L158 Benchmark]: Boogie Preprocessor took 38.14ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 104.3MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:58:09,082 INFO L158 Benchmark]: IcfgBuilder took 344.66ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 83.9MB in the end (delta: 20.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 15:58:09,083 INFO L158 Benchmark]: TraceAbstraction took 67135.74ms. Allocated memory was 167.8MB in the beginning and 847.2MB in the end (delta: 679.5MB). Free memory was 83.9MB in the beginning and 799.0MB in the end (delta: -715.1MB). Peak memory consumption was 452.8MB. Max. memory is 16.1GB. [2025-03-08 15:58:09,083 INFO L158 Benchmark]: Witness Printer took 2.65ms. Allocated memory is still 847.2MB. Free memory was 799.0MB in the beginning and 798.9MB in the end (delta: 177.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:58:09,084 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.35ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 111.0MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.76ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 108.1MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.14ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 104.3MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 344.66ms. Allocated memory is still 167.8MB. Free memory was 104.3MB in the beginning and 83.9MB in the end (delta: 20.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 67135.74ms. Allocated memory was 167.8MB in the beginning and 847.2MB in the end (delta: 679.5MB). Free memory was 83.9MB in the beginning and 799.0MB in the end (delta: -715.1MB). Peak memory consumption was 452.8MB. Max. memory is 16.1GB. * Witness Printer took 2.65ms. Allocated memory is still 847.2MB. Free memory was 799.0MB in the beginning and 798.9MB in the end (delta: 177.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] unsigned char last_1_var_1_12 = 1; VAL [isInitial=0, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L89] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L90] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L90] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L91] var_1_4 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L92] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L93] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L93] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L94] var_1_6 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L95] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L96] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L96] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L97] var_1_7 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L98] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L99] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L99] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L100] var_1_10 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L101] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L102] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L102] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L103] var_1_11 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L104] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L105] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L105] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L106] var_1_14 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L107] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L108] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L108] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L109] var_1_20 = __VERIFIER_nondet_short() [L110] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16355, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16355, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L110] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16355, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L111] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16355, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16355, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L111] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16355, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L112] var_1_21 = __VERIFIER_nondet_short() [L113] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L113] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L114] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L114] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L128] RET updateVariables() [L129] CALL step() [L43] signed char stepLocal_1 = var_1_6; [L44] unsigned char stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_1=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L45] COND FALSE !(-25 == stepLocal_1) [L50] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=32767] [L52] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_2=2, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=32767] [L53] COND TRUE var_1_8 >= stepLocal_2 [L54] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=32767] [L56] COND TRUE \read(var_1_12) [L57] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=32767] [L59] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=32767] [L60] COND TRUE \read(var_1_12) [L61] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=32767] [L64] signed char stepLocal_4 = var_1_6; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_4=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=32767] [L65] COND TRUE var_1_1 < stepLocal_4 [L66] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-1, var_1_19=25, var_1_1=0, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=32767] [L70] COND TRUE \read(var_1_12) [L71] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-1, var_1_19=-16352, var_1_1=0, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=32767] [L73] COND TRUE -64 > (var_1_6 + var_1_19) [L74] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32765, var_1_16=-16, var_1_18=-1, var_1_19=-16352, var_1_1=0, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=32767] [L82] signed long int stepLocal_3 = ((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10); VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_3=32767, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32765, var_1_16=-16, var_1_18=-1, var_1_19=-16352, var_1_1=0, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=32767] [L83] COND FALSE !(var_1_19 > stepLocal_3) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32765, var_1_16=-16, var_1_18=-1, var_1_19=-16352, var_1_1=0, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=32767] [L129] RET step() [L130] CALL, EXPR property() [L120-L121] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_19)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_12 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32765, var_1_16=-16, var_1_18=-1, var_1_19=-16352, var_1_1=0, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=32767] [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32765, var_1_16=-16, var_1_18=-1, var_1_19=-16352, var_1_1=0, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32765, var_1_16=-16, var_1_18=-1, var_1_19=-16352, var_1_1=0, var_1_20=16355, var_1_21=16355, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=2, var_1_8=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 109 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.0s, OverallIterations: 12, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1606 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1597 mSDsluCounter, 4182 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3177 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3697 IncrementalHoareTripleChecker+Invalid, 3813 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 1005 mSDtfsCounter, 3697 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 19.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=447occurred in iteration=11, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 636 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 54.6s InterpolantComputationTime, 1789 NumberOfCodeBlocks, 1789 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1417 ConstructedInterpolants, 1 QuantifiedInterpolants, 13593 SizeOfPredicates, 9 NumberOfNonLiveVariables, 575 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 7208/7344 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 15:58:09,300 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-08 15:58:09,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_operatoramount_amount50_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 46dcd3bee3e07f84df18611ceb0a68103be2f6eabf5254259333ed4c471ba4e1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:58:10,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:58:10,978 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:58:10,984 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:58:10,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:58:11,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:58:11,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:58:11,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:58:11,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:58:11,008 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:58:11,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:58:11,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:58:11,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:58:11,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:58:11,009 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:58:11,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:58:11,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:58:11,010 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:58:11,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:58:11,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:58:11,010 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:58:11,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:58:11,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:58:11,010 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:58:11,010 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:58:11,010 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:58:11,010 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:58:11,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:58:11,010 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:58:11,010 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:58:11,011 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:58:11,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:58:11,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:58:11,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:58:11,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:58:11,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:58:11,011 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:58:11,011 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:58:11,011 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:58:11,011 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:58:11,011 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:58:11,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:58:11,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:58:11,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:58:11,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:58:11,012 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 46dcd3bee3e07f84df18611ceb0a68103be2f6eabf5254259333ed4c471ba4e1 [2025-03-08 15:58:11,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:58:11,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:58:11,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:58:11,242 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:58:11,242 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:58:11,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i [2025-03-08 15:58:12,438 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/613ecece4/52ea171984eb426c91168ccfa60e78e2/FLAGc429ffd03 [2025-03-08 15:58:12,620 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:58:12,621 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i [2025-03-08 15:58:12,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/613ecece4/52ea171984eb426c91168ccfa60e78e2/FLAGc429ffd03 [2025-03-08 15:58:12,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/613ecece4/52ea171984eb426c91168ccfa60e78e2 [2025-03-08 15:58:12,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:58:12,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:58:12,646 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:58:12,647 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:58:12,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:58:12,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:58:12" (1/1) ... [2025-03-08 15:58:12,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46ce623b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:12, skipping insertion in model container [2025-03-08 15:58:12,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:58:12" (1/1) ... [2025-03-08 15:58:12,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:58:12,772 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_operatoramount_amount50_file-66.i[915,928] [2025-03-08 15:58:12,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:58:12,817 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:58:12,825 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_operatoramount_amount50_file-66.i[915,928] [2025-03-08 15:58:12,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:58:12,870 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:58:12,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:12 WrapperNode [2025-03-08 15:58:12,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:58:12,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:58:12,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:58:12,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:58:12,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:12" (1/1) ... [2025-03-08 15:58:12,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:12" (1/1) ... [2025-03-08 15:58:12,906 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-03-08 15:58:12,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:58:12,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:58:12,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:58:12,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:58:12,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:12" (1/1) ... [2025-03-08 15:58:12,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:12" (1/1) ... [2025-03-08 15:58:12,916 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:12" (1/1) ... [2025-03-08 15:58:12,931 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]. [2025-03-08 15:58:12,931 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:12" (1/1) ... [2025-03-08 15:58:12,932 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:12" (1/1) ... [2025-03-08 15:58:12,936 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:12" (1/1) ... [2025-03-08 15:58:12,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:12" (1/1) ... [2025-03-08 15:58:12,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:12" (1/1) ... [2025-03-08 15:58:12,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:12" (1/1) ... [2025-03-08 15:58:12,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:58:12,949 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:58:12,949 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:58:12,949 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:58:12,949 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:12" (1/1) ... [2025-03-08 15:58:12,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:58:12,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:58:12,972 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) [2025-03-08 15:58:12,974 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 [2025-03-08 15:58:12,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:58:12,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:58:12,990 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:58:12,990 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:58:12,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:58:12,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:58:13,042 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:58:13,044 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:58:13,341 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 15:58:13,342 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:58:13,350 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:58:13,350 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:58:13,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:58:13 BoogieIcfgContainer [2025-03-08 15:58:13,351 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:58:13,352 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:58:13,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:58:13,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:58:13,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:58:12" (1/3) ... [2025-03-08 15:58:13,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94f592e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:58:13, skipping insertion in model container [2025-03-08 15:58:13,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:58:12" (2/3) ... [2025-03-08 15:58:13,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94f592e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:58:13, skipping insertion in model container [2025-03-08 15:58:13,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:58:13" (3/3) ... [2025-03-08 15:58:13,360 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-66.i [2025-03-08 15:58:13,369 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:58:13,370 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-66.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:58:13,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:58:13,414 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;@2d6e2347, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:58:13,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:58:13,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 15:58:13,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 15:58:13,427 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:58:13,428 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:58:13,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:58:13,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:58:13,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2140051745, now seen corresponding path program 1 times [2025-03-08 15:58:13,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:58:13,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393512752] [2025-03-08 15:58:13,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:58:13,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:58:13,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:58:13,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:58:13,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 15:58:13,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 15:58:13,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 15:58:13,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:13,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:58:13,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:58:13,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:58:13,631 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-08 15:58:13,631 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:58:13,631 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:58:13,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393512752] [2025-03-08 15:58:13,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393512752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:58:13,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:58:13,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:58:13,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198094678] [2025-03-08 15:58:13,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:58:13,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:58:13,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:58:13,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:58:13,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:58:13,649 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 15:58:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:58:13,663 INFO L93 Difference]: Finished difference Result 114 states and 195 transitions. [2025-03-08 15:58:13,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:58:13,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2025-03-08 15:58:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:58:13,668 INFO L225 Difference]: With dead ends: 114 [2025-03-08 15:58:13,668 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 15:58:13,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:58:13,671 INFO L435 NwaCegarLoop]: 86 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, 86 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 [2025-03-08 15:58:13,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:58:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 15:58:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-08 15:58:13,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 15:58:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2025-03-08 15:58:13,715 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 119 [2025-03-08 15:58:13,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:58:13,715 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2025-03-08 15:58:13,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 15:58:13,716 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2025-03-08 15:58:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 15:58:13,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:58:13,719 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:58:13,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 15:58:13,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:58:13,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:58:13,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:58:13,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1937578433, now seen corresponding path program 1 times [2025-03-08 15:58:13,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:58:13,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500098091] [2025-03-08 15:58:13,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:58:13,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:58:13,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:58:13,922 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:58:13,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 15:58:13,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 15:58:14,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 15:58:14,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:58:14,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:58:14,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 15:58:14,058 INFO L279 TraceCheckSpWp]: Computing forward predicates...