./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_fillercode_fillercodestructure_filler-pr-co_file-70.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 63d28592561f54f4f96e786181b959744072197846b5c63dc5da76e6f0017f40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:30:59,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:30:59,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:30:59,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:30:59,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:30:59,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:30:59,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:30:59,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:30:59,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:30:59,420 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:30:59,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:30:59,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:30:59,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:30:59,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:30:59,421 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:30:59,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:30:59,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:30:59,421 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:30:59,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:30:59,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:30:59,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:30:59,421 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:30:59,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:30:59,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:30:59,422 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:30:59,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:30:59,422 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:30:59,422 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:30:59,422 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:30:59,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:30:59,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:30:59,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:30:59,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:30:59,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:30:59,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:30:59,423 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:30:59,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:30:59,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:30:59,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:30:59,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:30:59,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:30:59,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:30:59,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:30:59,423 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 -> 63d28592561f54f4f96e786181b959744072197846b5c63dc5da76e6f0017f40 [2025-03-03 21:30:59,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:30:59,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:30:59,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:30:59,674 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:30:59,674 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:30:59,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i [2025-03-03 21:31:00,820 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cd313a0b/73a7a638aa9e48b7b91df317659d56f3/FLAG21a54c3a2 [2025-03-03 21:31:01,038 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:31:01,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i [2025-03-03 21:31:01,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cd313a0b/73a7a638aa9e48b7b91df317659d56f3/FLAG21a54c3a2 [2025-03-03 21:31:01,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cd313a0b/73a7a638aa9e48b7b91df317659d56f3 [2025-03-03 21:31:01,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:31:01,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:31:01,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:31:01,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:31:01,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:31:01,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:31:01" (1/1) ... [2025-03-03 21:31:01,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f13129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:01, skipping insertion in model container [2025-03-03 21:31:01,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:31:01" (1/1) ... [2025-03-03 21:31:01,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:31:01,493 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i[919,932] [2025-03-03 21:31:01,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:31:01,544 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:31:01,550 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i[919,932] [2025-03-03 21:31:01,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:31:01,584 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:31:01,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:01 WrapperNode [2025-03-03 21:31:01,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:31:01,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:31:01,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:31:01,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:31:01,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:01" (1/1) ... [2025-03-03 21:31:01,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:01" (1/1) ... [2025-03-03 21:31:01,622 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2025-03-03 21:31:01,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:31:01,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:31:01,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:31:01,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:31:01,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:01" (1/1) ... [2025-03-03 21:31:01,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:01" (1/1) ... [2025-03-03 21:31:01,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:01" (1/1) ... [2025-03-03 21:31:01,641 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-03 21:31:01,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:01" (1/1) ... [2025-03-03 21:31:01,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:01" (1/1) ... [2025-03-03 21:31:01,647 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:01" (1/1) ... [2025-03-03 21:31:01,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:01" (1/1) ... [2025-03-03 21:31:01,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:01" (1/1) ... [2025-03-03 21:31:01,650 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:01" (1/1) ... [2025-03-03 21:31:01,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:31:01,656 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:31:01,656 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:31:01,656 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:31:01,657 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:01" (1/1) ... [2025-03-03 21:31:01,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:31:01,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:31:01,682 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-03 21:31:01,684 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-03 21:31:01,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:31:01,699 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:31:01,699 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:31:01,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:31:01,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:31:01,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:31:01,768 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:31:01,770 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:31:02,101 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 21:31:02,101 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:31:02,114 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:31:02,115 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:31:02,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:31:02 BoogieIcfgContainer [2025-03-03 21:31:02,116 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:31:02,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:31:02,119 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:31:02,121 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:31:02,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:31:01" (1/3) ... [2025-03-03 21:31:02,122 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc168a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:31:02, skipping insertion in model container [2025-03-03 21:31:02,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:01" (2/3) ... [2025-03-03 21:31:02,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc168a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:31:02, skipping insertion in model container [2025-03-03 21:31:02,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:31:02" (3/3) ... [2025-03-03 21:31:02,124 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i [2025-03-03 21:31:02,133 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:31:02,136 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:31:02,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:31:02,188 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;@3d4aca8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:31:02,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:31:02,192 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 21:31:02,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 21:31:02,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:31:02,203 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:31:02,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:31:02,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:31:02,207 INFO L85 PathProgramCache]: Analyzing trace with hash -535778949, now seen corresponding path program 1 times [2025-03-03 21:31:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:31:02,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007299962] [2025-03-03 21:31:02,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:31:02,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:31:02,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:31:02,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:02,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 21:31:02,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:31:02,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007299962] [2025-03-03 21:31:02,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007299962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:31:02,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911697425] [2025-03-03 21:31:02,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:02,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:31:02,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:31:02,462 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-03 21:31:02,464 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-03 21:31:02,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:31:02,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:31:02,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:02,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:02,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:31:02,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:31:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 21:31:02,653 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:31:02,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911697425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:31:02,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:31:02,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:31:02,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011195864] [2025-03-03 21:31:02,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:31:02,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:31:02,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:31:02,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:31:02,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:31:02,679 INFO L87 Difference]: Start difference. First operand has 86 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 21:31:02,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:31:02,697 INFO L93 Difference]: Finished difference Result 165 states and 287 transitions. [2025-03-03 21:31:02,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:31:02,699 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2025-03-03 21:31:02,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:31:02,703 INFO L225 Difference]: With dead ends: 165 [2025-03-03 21:31:02,703 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 21:31:02,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 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-03 21:31:02,706 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:31:02,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:31:02,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 21:31:02,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-03 21:31:02,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 21:31:02,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2025-03-03 21:31:02,734 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 165 [2025-03-03 21:31:02,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:31:02,734 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2025-03-03 21:31:02,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 21:31:02,735 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2025-03-03 21:31:02,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 21:31:02,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:31:02,737 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:31:02,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 21:31:02,937 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-03 21:31:02,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:31:02,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:31:02,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1373954055, now seen corresponding path program 1 times [2025-03-03 21:31:02,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:31:02,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143321848] [2025-03-03 21:31:02,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:02,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:31:02,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:31:03,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:31:03,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:03,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 21:31:03,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:31:03,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143321848] [2025-03-03 21:31:03,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143321848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:31:03,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:31:03,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:31:03,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921958149] [2025-03-03 21:31:03,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:31:03,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:31:03,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:31:03,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:31:03,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:31:03,459 INFO L87 Difference]: Start difference. First operand 82 states and 124 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 21:31:03,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:31:03,541 INFO L93 Difference]: Finished difference Result 236 states and 349 transitions. [2025-03-03 21:31:03,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:31:03,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-03-03 21:31:03,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:31:03,547 INFO L225 Difference]: With dead ends: 236 [2025-03-03 21:31:03,547 INFO L226 Difference]: Without dead ends: 157 [2025-03-03 21:31:03,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:31:03,548 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 94 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:31:03,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 361 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:31:03,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-03 21:31:03,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 124. [2025-03-03 21:31:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 94 states have internal predecessors, (130), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 21:31:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 186 transitions. [2025-03-03 21:31:03,573 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 186 transitions. Word has length 165 [2025-03-03 21:31:03,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:31:03,573 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 186 transitions. [2025-03-03 21:31:03,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 21:31:03,574 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 186 transitions. [2025-03-03 21:31:03,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 21:31:03,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:31:03,576 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:31:03,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:31:03,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:31:03,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:31:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1124061882, now seen corresponding path program 1 times [2025-03-03 21:31:03,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:31:03,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399016328] [2025-03-03 21:31:03,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:03,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:31:03,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:31:03,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:31:03,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:03,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 21:31:03,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:31:03,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399016328] [2025-03-03 21:31:03,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399016328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:31:03,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:31:03,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:31:03,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209962229] [2025-03-03 21:31:03,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:31:03,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:31:03,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:31:03,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:31:03,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:31:03,906 INFO L87 Difference]: Start difference. First operand 124 states and 186 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 21:31:03,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:31:03,976 INFO L93 Difference]: Finished difference Result 280 states and 413 transitions. [2025-03-03 21:31:03,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:31:03,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-03-03 21:31:03,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:31:03,981 INFO L225 Difference]: With dead ends: 280 [2025-03-03 21:31:03,981 INFO L226 Difference]: Without dead ends: 159 [2025-03-03 21:31:03,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:31:03,982 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 110 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:31:03,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 309 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:31:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-03 21:31:04,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 125. [2025-03-03 21:31:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 95 states have internal predecessors, (131), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 21:31:04,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 187 transitions. [2025-03-03 21:31:04,005 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 187 transitions. Word has length 165 [2025-03-03 21:31:04,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:31:04,005 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 187 transitions. [2025-03-03 21:31:04,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 21:31:04,006 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 187 transitions. [2025-03-03 21:31:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 21:31:04,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:31:04,009 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:31:04,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:31:04,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:31:04,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:31:04,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1253144601, now seen corresponding path program 1 times [2025-03-03 21:31:04,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:31:04,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597410933] [2025-03-03 21:31:04,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:04,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:31:04,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:31:04,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:31:04,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:04,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 21:31:04,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:31:04,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597410933] [2025-03-03 21:31:04,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597410933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:31:04,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:31:04,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:31:04,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552958981] [2025-03-03 21:31:04,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:31:04,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:31:04,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:31:04,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:31:04,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:31:04,463 INFO L87 Difference]: Start difference. First operand 125 states and 187 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 21:31:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:31:04,620 INFO L93 Difference]: Finished difference Result 367 states and 551 transitions. [2025-03-03 21:31:04,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:31:04,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-03-03 21:31:04,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:31:04,625 INFO L225 Difference]: With dead ends: 367 [2025-03-03 21:31:04,625 INFO L226 Difference]: Without dead ends: 245 [2025-03-03 21:31:04,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:31:04,626 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 58 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:31:04,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 256 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:31:04,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-03 21:31:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2025-03-03 21:31:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 184 states have internal predecessors, (250), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-03 21:31:04,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 362 transitions. [2025-03-03 21:31:04,652 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 362 transitions. Word has length 165 [2025-03-03 21:31:04,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:31:04,652 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 362 transitions. [2025-03-03 21:31:04,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 21:31:04,653 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 362 transitions. [2025-03-03 21:31:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 21:31:04,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:31:04,654 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:31:04,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:31:04,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:31:04,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:31:04,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1254068122, now seen corresponding path program 1 times [2025-03-03 21:31:04,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:31:04,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447096721] [2025-03-03 21:31:04,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:04,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:31:04,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:31:04,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:31:04,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:04,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 33 proven. 39 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 21:31:05,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:31:05,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447096721] [2025-03-03 21:31:05,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447096721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:31:05,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906112002] [2025-03-03 21:31:05,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:05,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:31:05,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:31:05,515 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-03 21:31:05,517 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-03 21:31:05,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:31:05,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:31:05,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:05,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:05,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 21:31:05,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:31:06,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 633 proven. 72 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-03-03 21:31:06,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:31:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 66 proven. 75 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2025-03-03 21:31:07,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906112002] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:31:07,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:31:07,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 13] total 28 [2025-03-03 21:31:07,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881963510] [2025-03-03 21:31:07,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:31:07,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 21:31:07,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:31:07,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 21:31:07,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-03-03 21:31:07,745 INFO L87 Difference]: Start difference. First operand 243 states and 362 transitions. Second operand has 28 states, 27 states have (on average 4.222222222222222) internal successors, (114), 26 states have internal predecessors, (114), 7 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 7 states have call predecessors, (75), 7 states have call successors, (75) [2025-03-03 21:31:12,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:31:20,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:31:24,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:31:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:31:27,286 INFO L93 Difference]: Finished difference Result 1422 states and 2026 transitions. [2025-03-03 21:31:27,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-03-03 21:31:27,287 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.222222222222222) internal successors, (114), 26 states have internal predecessors, (114), 7 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 7 states have call predecessors, (75), 7 states have call successors, (75) Word has length 165 [2025-03-03 21:31:27,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:31:27,293 INFO L225 Difference]: With dead ends: 1422 [2025-03-03 21:31:27,293 INFO L226 Difference]: Without dead ends: 1162 [2025-03-03 21:31:27,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5247 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2577, Invalid=12185, Unknown=0, NotChecked=0, Total=14762 [2025-03-03 21:31:27,297 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 1880 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 2992 mSolverCounterSat, 935 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1881 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 3930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 935 IncrementalHoareTripleChecker+Valid, 2992 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2025-03-03 21:31:27,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1881 Valid, 1756 Invalid, 3930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [935 Valid, 2992 Invalid, 3 Unknown, 0 Unchecked, 15.8s Time] [2025-03-03 21:31:27,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2025-03-03 21:31:27,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 618. [2025-03-03 21:31:27,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 441 states have (on average 1.2970521541950113) internal successors, (572), 446 states have internal predecessors, (572), 155 states have call successors, (155), 21 states have call predecessors, (155), 21 states have return successors, (155), 150 states have call predecessors, (155), 155 states have call successors, (155) [2025-03-03 21:31:27,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 882 transitions. [2025-03-03 21:31:27,396 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 882 transitions. Word has length 165 [2025-03-03 21:31:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:31:27,396 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 882 transitions. [2025-03-03 21:31:27,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.222222222222222) internal successors, (114), 26 states have internal predecessors, (114), 7 states have call successors, (75), 4 states have call predecessors, (75), 8 states have return successors, (75), 7 states have call predecessors, (75), 7 states have call successors, (75) [2025-03-03 21:31:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 882 transitions. [2025-03-03 21:31:27,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 21:31:27,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:31:27,398 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:31:27,405 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-03 21:31:27,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:31:27,602 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:31:27,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:31:27,603 INFO L85 PathProgramCache]: Analyzing trace with hash -274302950, now seen corresponding path program 1 times [2025-03-03 21:31:27,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:31:27,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895630692] [2025-03-03 21:31:27,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:27,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:31:27,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:31:27,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:31:27,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:27,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 21:31:27,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:31:27,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895630692] [2025-03-03 21:31:27,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895630692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:31:27,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:31:27,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:31:27,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620455373] [2025-03-03 21:31:27,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:31:27,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:31:27,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:31:27,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:31:27,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:31:27,802 INFO L87 Difference]: Start difference. First operand 618 states and 882 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 21:31:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:31:27,968 INFO L93 Difference]: Finished difference Result 1471 states and 2097 transitions. [2025-03-03 21:31:27,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:31:27,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-03-03 21:31:27,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:31:27,976 INFO L225 Difference]: With dead ends: 1471 [2025-03-03 21:31:27,977 INFO L226 Difference]: Without dead ends: 1013 [2025-03-03 21:31:27,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:31:27,979 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 251 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:31:27,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 455 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:31:27,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-03-03 21:31:28,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 696. [2025-03-03 21:31:28,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 494 states have (on average 1.3016194331983806) internal successors, (643), 495 states have internal predecessors, (643), 175 states have call successors, (175), 26 states have call predecessors, (175), 26 states have return successors, (175), 174 states have call predecessors, (175), 175 states have call successors, (175) [2025-03-03 21:31:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 993 transitions. [2025-03-03 21:31:28,096 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 993 transitions. Word has length 165 [2025-03-03 21:31:28,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:31:28,098 INFO L471 AbstractCegarLoop]: Abstraction has 696 states and 993 transitions. [2025-03-03 21:31:28,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 21:31:28,098 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 993 transitions. [2025-03-03 21:31:28,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 21:31:28,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:31:28,099 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:31:28,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:31:28,100 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:31:28,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:31:28,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2071254309, now seen corresponding path program 1 times [2025-03-03 21:31:28,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:31:28,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881933623] [2025-03-03 21:31:28,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:28,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:31:28,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:31:28,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:31:28,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:28,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 21:31:28,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:31:28,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881933623] [2025-03-03 21:31:28,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881933623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:31:28,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210661513] [2025-03-03 21:31:28,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:28,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:31:28,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:31:28,311 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-03 21:31:28,312 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-03 21:31:28,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:31:28,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:31:28,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:28,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:28,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:31:28,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:31:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 282 proven. 63 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-03-03 21:31:28,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:31:28,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 21:31:28,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210661513] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:31:28,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:31:28,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 21:31:28,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418273941] [2025-03-03 21:31:28,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:31:28,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:31:28,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:31:28,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:31:28,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:31:28,847 INFO L87 Difference]: Start difference. First operand 696 states and 993 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-03 21:31:29,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:31:29,068 INFO L93 Difference]: Finished difference Result 1151 states and 1615 transitions. [2025-03-03 21:31:29,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:31:29,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 165 [2025-03-03 21:31:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:31:29,074 INFO L225 Difference]: With dead ends: 1151 [2025-03-03 21:31:29,074 INFO L226 Difference]: Without dead ends: 603 [2025-03-03 21:31:29,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:31:29,078 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 60 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:31:29,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 224 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:31:29,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-03 21:31:29,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 583. [2025-03-03 21:31:29,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 402 states have (on average 1.236318407960199) internal successors, (497), 403 states have internal predecessors, (497), 150 states have call successors, (150), 30 states have call predecessors, (150), 30 states have return successors, (150), 149 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-03 21:31:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 797 transitions. [2025-03-03 21:31:29,171 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 797 transitions. Word has length 165 [2025-03-03 21:31:29,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:31:29,173 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 797 transitions. [2025-03-03 21:31:29,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-03-03 21:31:29,174 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 797 transitions. [2025-03-03 21:31:29,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 21:31:29,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:31:29,176 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:31:29,182 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-03 21:31:29,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:31:29,377 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:31:29,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:31:29,377 INFO L85 PathProgramCache]: Analyzing trace with hash -294571008, now seen corresponding path program 1 times [2025-03-03 21:31:29,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:31:29,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310042124] [2025-03-03 21:31:29,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:29,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:31:29,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 21:31:29,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 21:31:29,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:29,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 21:31:29,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:31:29,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310042124] [2025-03-03 21:31:29,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310042124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:31:29,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:31:29,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:31:29,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747985100] [2025-03-03 21:31:29,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:31:29,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:31:29,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:31:29,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:31:29,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:31:29,555 INFO L87 Difference]: Start difference. First operand 583 states and 797 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 21:31:29,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:31:29,736 INFO L93 Difference]: Finished difference Result 981 states and 1355 transitions. [2025-03-03 21:31:29,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:31:29,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2025-03-03 21:31:29,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:31:29,740 INFO L225 Difference]: With dead ends: 981 [2025-03-03 21:31:29,741 INFO L226 Difference]: Without dead ends: 739 [2025-03-03 21:31:29,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:31:29,742 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 132 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:31:29,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 359 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:31:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-03-03 21:31:29,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 702. [2025-03-03 21:31:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 491 states have (on average 1.2505091649694502) internal successors, (614), 492 states have internal predecessors, (614), 175 states have call successors, (175), 35 states have call predecessors, (175), 35 states have return successors, (175), 174 states have call predecessors, (175), 175 states have call successors, (175) [2025-03-03 21:31:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 964 transitions. [2025-03-03 21:31:29,834 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 964 transitions. Word has length 166 [2025-03-03 21:31:29,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:31:29,835 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 964 transitions. [2025-03-03 21:31:29,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 21:31:29,835 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 964 transitions. [2025-03-03 21:31:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 21:31:29,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:31:29,837 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:31:29,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 21:31:29,837 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:31:29,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:31:29,838 INFO L85 PathProgramCache]: Analyzing trace with hash -157819339, now seen corresponding path program 1 times [2025-03-03 21:31:29,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:31:29,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970676162] [2025-03-03 21:31:29,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:29,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:31:29,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 21:31:29,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 21:31:29,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:29,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:31:29,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1556664713] [2025-03-03 21:31:29,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:29,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:31:29,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:31:29,911 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:31:29,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 21:31:29,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 21:31:30,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 21:31:30,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:30,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:30,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:31:30,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:31:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-03-03 21:31:30,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:31:30,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:31:30,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970676162] [2025-03-03 21:31:30,617 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 21:31:30,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1556664713] [2025-03-03 21:31:30,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1556664713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:31:30,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:31:30,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-03 21:31:30,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680570544] [2025-03-03 21:31:30,618 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 21:31:30,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:31:30,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:31:30,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:31:30,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 21:31:30,619 INFO L87 Difference]: Start difference. First operand 702 states and 964 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 21:31:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:31:30,828 INFO L93 Difference]: Finished difference Result 944 states and 1288 transitions. [2025-03-03 21:31:30,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:31:30,829 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2025-03-03 21:31:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:31:30,832 INFO L225 Difference]: With dead ends: 944 [2025-03-03 21:31:30,832 INFO L226 Difference]: Without dead ends: 398 [2025-03-03 21:31:30,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:31:30,833 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 59 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:31:30,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 219 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:31:30,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-03 21:31:30,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 377. [2025-03-03 21:31:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 254 states have (on average 1.1771653543307086) internal successors, (299), 255 states have internal predecessors, (299), 100 states have call successors, (100), 22 states have call predecessors, (100), 22 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 21:31:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 499 transitions. [2025-03-03 21:31:30,889 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 499 transitions. Word has length 167 [2025-03-03 21:31:30,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:31:30,890 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 499 transitions. [2025-03-03 21:31:30,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 21:31:30,890 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 499 transitions. [2025-03-03 21:31:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 21:31:30,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:31:30,892 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:31:30,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 21:31:31,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:31:31,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:31:31,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:31:31,093 INFO L85 PathProgramCache]: Analyzing trace with hash -2035191322, now seen corresponding path program 1 times [2025-03-03 21:31:31,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:31:31,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915100578] [2025-03-03 21:31:31,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:31,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:31:31,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 21:31:31,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 21:31:31,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:31,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 21:31:31,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2005768583] [2025-03-03 21:31:31,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:31,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:31:31,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:31:31,202 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 21:31:31,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 21:31:31,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 21:31:31,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 21:31:31,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:31,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:31:31,354 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:31:31,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 21:31:31,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 21:31:31,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:31,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:31:31,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:31:31,468 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:31:31,469 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:31:31,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 21:31:31,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 21:31:31,677 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:31:31,761 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:31:31,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:31:31 BoogieIcfgContainer [2025-03-03 21:31:31,764 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:31:31,764 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:31:31,764 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:31:31,765 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:31:31,765 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:31:02" (3/4) ... [2025-03-03 21:31:31,766 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:31:31,767 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:31:31,768 INFO L158 Benchmark]: Toolchain (without parser) took 30382.94ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 112.1MB in the beginning and 153.6MB in the end (delta: -41.5MB). Peak memory consumption was 113.8MB. Max. memory is 16.1GB. [2025-03-03 21:31:31,768 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:31:31,768 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.82ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 96.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:31:31,768 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.76ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 92.2MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:31:31,768 INFO L158 Benchmark]: Boogie Preprocessor took 32.59ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 87.2MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:31:31,769 INFO L158 Benchmark]: IcfgBuilder took 459.59ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 58.7MB in the end (delta: 28.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 21:31:31,769 INFO L158 Benchmark]: TraceAbstraction took 29645.39ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 58.1MB in the beginning and 153.7MB in the end (delta: -95.5MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2025-03-03 21:31:31,769 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 293.6MB. Free memory was 153.7MB in the beginning and 153.6MB in the end (delta: 60.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 21:31:31,770 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.20ms. Allocated memory is still 226.5MB. Free memory is still 147.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.82ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 96.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.76ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 92.2MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.59ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 87.2MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 459.59ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 58.7MB in the end (delta: 28.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 29645.39ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 58.1MB in the beginning and 153.7MB in the end (delta: -95.5MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 293.6MB. Free memory was 153.7MB in the beginning and 153.6MB in the end (delta: 60.1kB). 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 135, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryDOUBLEComparisonOperation at line 131. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.05; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 49.5; [L25] double var_1_8 = 16.75; [L26] unsigned short int var_1_9 = 1; [L27] unsigned long int var_1_11 = 8; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_14 = 32; [L31] unsigned char var_1_15 = 50; [L32] unsigned char var_1_16 = 8; [L33] unsigned char var_1_17 = 32; [L34] unsigned long int var_1_18 = 2; [L35] unsigned long int var_1_19 = 3876014737; [L36] unsigned char var_1_20 = 0; [L37] unsigned short int var_1_21 = 25; [L38] unsigned char var_1_27 = 1; [L39] unsigned char var_1_30 = 1; [L40] unsigned char var_1_31 = 1; [L41] unsigned char var_1_32 = 0; [L42] unsigned long int var_1_33 = 2; [L43] unsigned short int var_1_34 = 0; [L44] signed short int var_1_35 = -10; [L45] double var_1_36 = 128.5; [L46] double var_1_37 = 128.25; [L47] unsigned char var_1_40 = 2; [L48] unsigned char var_1_41 = 25; [L49] unsigned short int var_1_42 = 8; [L50] unsigned long int var_1_43 = 3563499258; [L51] unsigned long int var_1_44 = 1249494912; [L52] double last_1_var_1_1 = 5.05; [L53] unsigned short int last_1_var_1_9 = 1; [L54] unsigned long int last_1_var_1_11 = 8; [L55] unsigned char last_1_var_1_14 = 32; [L56] unsigned char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_9 = var_1_9 [L174] last_1_var_1_11 = var_1_11 [L175] last_1_var_1_14 = var_1_14 [L176] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L186] RET updateLastVariables() [L187] CALL updateVariables() [L130] var_1_6 = __VERIFIER_nondet_double() [L131] CALL assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L131] RET assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L132] var_1_7 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L133] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L134] var_1_8 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L135] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L136] var_1_13 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L137] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L138] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L139] var_1_15 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L140] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L141] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L142] var_1_16 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L143] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L144] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L145] var_1_17 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L146] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L147] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L148] var_1_19 = __VERIFIER_nondet_ulong() [L149] CALL assume_abort_if_not(var_1_19 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L149] RET assume_abort_if_not(var_1_19 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L150] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L151] var_1_30 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L152] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L153] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L154] var_1_32 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L155] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L156] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L156] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_36=257/2, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L158] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_37=513/4, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L159] var_1_37 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L160] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=25, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L161] var_1_41 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_41 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L162] RET assume_abort_if_not(var_1_41 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_41 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L163] RET assume_abort_if_not(var_1_41 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=3563499258, var_1_44=1249494912, var_1_9=1] [L164] var_1_43 = __VERIFIER_nondet_ulong() [L165] CALL assume_abort_if_not(var_1_43 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L165] RET assume_abort_if_not(var_1_43 >= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_43 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L166] RET assume_abort_if_not(var_1_43 <= 4294967295) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1249494912, var_1_9=1] [L167] var_1_44 = __VERIFIER_nondet_ulong() [L168] CALL assume_abort_if_not(var_1_44 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L168] RET assume_abort_if_not(var_1_44 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_44 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L169] RET assume_abort_if_not(var_1_44 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=2, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L187] RET updateVariables() [L188] CALL step() [L60] COND TRUE \read(var_1_13) [L61] var_1_18 = ((var_1_19 - last_1_var_1_9) - last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L65] COND FALSE !(var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L74] COND TRUE var_1_14 >= (~ var_1_9) [L75] var_1_40 = var_1_41 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L77] COND TRUE (8 - 64) <= (var_1_9 - var_1_9) [L78] var_1_14 = (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L82] signed long int stepLocal_0 = - ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))); VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, stepLocal_0=-1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_9=1] [L83] COND FALSE !(var_1_18 >= stepLocal_0) [L86] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L88] var_1_34 = (var_1_14 + 4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=8, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L89] COND FALSE !(\read(var_1_12)) [L98] var_1_42 = var_1_14 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L100] COND TRUE (var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14))) [L101] var_1_20 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L103] COND TRUE \read(var_1_20) [L104] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L106] COND TRUE (var_1_9 <= var_1_9) && var_1_12 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L107] EXPR var_1_14 & var_1_14 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L107] COND TRUE ! (((((var_1_18) > (var_1_9)) ? (var_1_18) : (var_1_9))) < (var_1_14 & var_1_14)) [L108] var_1_27 = var_1_30 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=2, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L117] var_1_33 = var_1_14 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=-10, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L118] COND TRUE ((var_1_36 - var_1_37) + var_1_1) == var_1_1 [L119] var_1_35 = var_1_9 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L121] var_1_11 = (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L122] COND FALSE !(((((var_1_9) < (var_1_14)) ? (var_1_9) : (var_1_14))) > var_1_9) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L125] COND FALSE !(var_1_18 > (- var_1_9)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L188] RET step() [L189] CALL, EXPR property() [L179-L180] return (((((((var_1_18 >= (- ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))) ? (var_1_1 == ((double) (((var_1_6 - var_1_7) - ((((64.75) > (128.725)) ? (64.75) : (128.725)))) + var_1_8))) : (var_1_1 == ((double) var_1_7))) && ((var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) ? ((! ((last_1_var_1_1 == var_1_7) && (last_1_var_1_20 || last_1_var_1_20))) ? ((! (var_1_6 <= var_1_7)) ? (var_1_9 == ((unsigned short int) ((((last_1_var_1_14) < (last_1_var_1_14)) ? (last_1_var_1_14) : (last_1_var_1_14))))) : 1) : (var_1_9 == ((unsigned short int) last_1_var_1_14))) : 1)) && (var_1_11 == ((unsigned long int) (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u))))) && (var_1_20 ? (var_1_12 == ((unsigned char) var_1_13)) : 1)) && (((8 - 64) <= (var_1_9 - var_1_9)) ? (var_1_14 == ((unsigned char) (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_17)))) && (var_1_13 ? (var_1_18 == ((unsigned long int) ((var_1_19 - last_1_var_1_9) - last_1_var_1_11))) : (var_1_18 == ((unsigned long int) (((((var_1_19 - var_1_17)) > (var_1_15)) ? ((var_1_19 - var_1_17)) : (var_1_15))))))) && (((var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) ? (var_1_20 == ((unsigned char) var_1_13)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=-11, var_1_19=-2, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=2147483647, var_1_44=1073741823, var_1_7=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.5s, OverallIterations: 10, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 2659 SdHoareTripleChecker+Valid, 16.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2644 mSDsluCounter, 4062 SdHoareTripleChecker+Invalid, 15.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2872 mSDsCounter, 1034 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3504 IncrementalHoareTripleChecker+Invalid, 4541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1034 mSolverCounterUnsat, 1190 mSDtfsCounter, 3504 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1180 GetRequests, 1032 SyntacticMatches, 1 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5249 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=702occurred in iteration=8, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 1008 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 2484 NumberOfCodeBlocks, 2484 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2299 ConstructedInterpolants, 0 QuantifiedInterpolants, 8080 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1580 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 16338/16800 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-03 21:31:31,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 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_fillercode_fillercodestructure_filler-pr-co_file-70.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 63d28592561f54f4f96e786181b959744072197846b5c63dc5da76e6f0017f40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:31:33,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:31:33,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:31:33,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:31:33,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:31:33,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:31:33,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:31:33,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:31:33,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:31:33,617 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:31:33,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:31:33,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:31:33,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:31:33,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:31:33,617 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:31:33,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:31:33,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:31:33,617 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:31:33,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:31:33,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:31:33,617 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:31:33,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:31:33,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:31:33,618 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:31:33,618 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:31:33,618 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:31:33,618 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:31:33,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:31:33,619 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:31:33,619 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:31:33,619 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:31:33,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:31:33,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:31:33,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:31:33,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:31:33,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:31:33,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:31:33,619 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:31:33,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:31:33,620 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:31:33,620 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:31:33,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:31:33,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:31:33,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:31:33,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:31:33,620 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 -> 63d28592561f54f4f96e786181b959744072197846b5c63dc5da76e6f0017f40 [2025-03-03 21:31:33,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:31:33,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:31:33,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:31:33,863 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:31:33,864 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:31:33,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i [2025-03-03 21:31:35,080 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74a410d95/4aac9cbd26b44091ae144a8b58e2f997/FLAG635710238 [2025-03-03 21:31:35,239 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:31:35,240 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i [2025-03-03 21:31:35,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74a410d95/4aac9cbd26b44091ae144a8b58e2f997/FLAG635710238 [2025-03-03 21:31:35,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74a410d95/4aac9cbd26b44091ae144a8b58e2f997 [2025-03-03 21:31:35,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:31:35,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:31:35,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:31:35,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:31:35,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:31:35,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:31:35" (1/1) ... [2025-03-03 21:31:35,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2201fb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:35, skipping insertion in model container [2025-03-03 21:31:35,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:31:35" (1/1) ... [2025-03-03 21:31:35,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:31:35,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i[919,932] [2025-03-03 21:31:35,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:31:35,464 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:31:35,473 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i[919,932] [2025-03-03 21:31:35,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:31:35,510 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:31:35,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:35 WrapperNode [2025-03-03 21:31:35,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:31:35,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:31:35,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:31:35,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:31:35,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:35" (1/1) ... [2025-03-03 21:31:35,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:35" (1/1) ... [2025-03-03 21:31:35,558 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-03-03 21:31:35,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:31:35,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:31:35,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:31:35,560 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:31:35,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:35" (1/1) ... [2025-03-03 21:31:35,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:35" (1/1) ... [2025-03-03 21:31:35,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:35" (1/1) ... [2025-03-03 21:31:35,587 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-03 21:31:35,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:35" (1/1) ... [2025-03-03 21:31:35,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:35" (1/1) ... [2025-03-03 21:31:35,603 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:35" (1/1) ... [2025-03-03 21:31:35,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:35" (1/1) ... [2025-03-03 21:31:35,605 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:35" (1/1) ... [2025-03-03 21:31:35,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:35" (1/1) ... [2025-03-03 21:31:35,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:31:35,609 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:31:35,609 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:31:35,609 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:31:35,610 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:35" (1/1) ... [2025-03-03 21:31:35,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:31:35,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:31:35,639 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-03 21:31:35,643 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-03 21:31:35,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:31:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:31:35,664 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:31:35,664 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:31:35,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:31:35,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:31:35,745 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:31:35,747 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:31:45,303 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 21:31:45,303 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:31:45,309 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:31:45,310 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:31:45,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:31:45 BoogieIcfgContainer [2025-03-03 21:31:45,310 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:31:45,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:31:45,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:31:45,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:31:45,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:31:35" (1/3) ... [2025-03-03 21:31:45,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff0d882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:31:45, skipping insertion in model container [2025-03-03 21:31:45,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:31:35" (2/3) ... [2025-03-03 21:31:45,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff0d882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:31:45, skipping insertion in model container [2025-03-03 21:31:45,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:31:45" (3/3) ... [2025-03-03 21:31:45,317 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i [2025-03-03 21:31:45,327 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:31:45,329 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-70.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:31:45,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:31:45,386 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;@7eaf230e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:31:45,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:31:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 53 states have internal predecessors, (74), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 21:31:45,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 21:31:45,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:31:45,402 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:31:45,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:31:45,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:31:45,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1575133573, now seen corresponding path program 1 times [2025-03-03 21:31:45,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:31:45,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909734812] [2025-03-03 21:31:45,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:45,419 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-03 21:31:45,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:31:45,421 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-03 21:31:45,423 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-03 21:31:45,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:31:45,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:31:45,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:45,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:45,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:31:45,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:31:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2025-03-03 21:31:45,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:31:45,899 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:31:45,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909734812] [2025-03-03 21:31:45,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909734812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:31:45,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:31:45,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:31:45,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173948336] [2025-03-03 21:31:45,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:31:45,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:31:45,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:31:45,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:31:45,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:31:45,920 INFO L87 Difference]: Start difference. First operand has 80 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 53 states have internal predecessors, (74), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 21:31:45,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:31:45,936 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2025-03-03 21:31:45,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:31:45,938 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2025-03-03 21:31:45,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:31:45,941 INFO L225 Difference]: With dead ends: 154 [2025-03-03 21:31:45,942 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 21:31:45,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 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-03 21:31:45,945 INFO L435 NwaCegarLoop]: 115 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, 115 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-03 21:31:45,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:31:45,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 21:31:45,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-03 21:31:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 21:31:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2025-03-03 21:31:45,985 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 165 [2025-03-03 21:31:45,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:31:45,986 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2025-03-03 21:31:45,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 21:31:45,987 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2025-03-03 21:31:45,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 21:31:45,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:31:45,990 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:31:46,008 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-03 21:31:46,191 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-03 21:31:46,191 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:31:46,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:31:46,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1881658617, now seen corresponding path program 1 times [2025-03-03 21:31:46,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:31:46,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374108566] [2025-03-03 21:31:46,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:46,193 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-03 21:31:46,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:31:46,195 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-03 21:31:46,197 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-03 21:31:46,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:31:46,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:31:46,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:46,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:46,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 21:31:46,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:31:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-03-03 21:31:49,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:31:50,552 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:31:50,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374108566] [2025-03-03 21:31:50,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374108566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:31:50,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [459297041] [2025-03-03 21:31:50,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:50,554 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:31:50,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:31:50,577 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:31:50,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-03 21:31:50,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:31:51,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:31:51,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:51,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:51,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 21:31:51,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:31:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 21:31:51,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:31:51,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [459297041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:31:51,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:31:51,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2025-03-03 21:31:51,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120879774] [2025-03-03 21:31:51,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:31:51,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:31:51,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:31:51,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:31:51,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:31:51,947 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 21:31:53,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:31:55,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:31:58,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:31:58,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:31:58,519 INFO L93 Difference]: Finished difference Result 224 states and 337 transitions. [2025-03-03 21:31:58,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:31:58,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-03-03 21:31:58,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:31:58,523 INFO L225 Difference]: With dead ends: 224 [2025-03-03 21:31:58,523 INFO L226 Difference]: Without dead ends: 150 [2025-03-03 21:31:58,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-03 21:31:58,524 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 21 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:31:58,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 191 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2025-03-03 21:31:58,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-03 21:31:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2025-03-03 21:31:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 95 states have (on average 1.2842105263157895) internal successors, (122), 95 states have internal predecessors, (122), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 21:31:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 222 transitions. [2025-03-03 21:31:58,558 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 222 transitions. Word has length 165 [2025-03-03 21:31:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:31:58,558 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 222 transitions. [2025-03-03 21:31:58,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 21:31:58,559 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 222 transitions. [2025-03-03 21:31:58,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 21:31:58,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:31:58,561 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:31:58,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-03-03 21:31:58,776 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 (3)] Ended with exit code 0 [2025-03-03 21:31:58,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /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-03 21:31:58,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:31:58,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:31:58,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1882582138, now seen corresponding path program 1 times [2025-03-03 21:31:58,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:31:58,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474092283] [2025-03-03 21:31:58,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:31:58,963 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-03 21:31:58,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:31:58,965 INFO L229 MonitoredProcess]: Starting monitored process 5 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-03 21:31:58,966 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 (5)] Waiting until timeout for monitored process [2025-03-03 21:31:58,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:31:59,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:31:59,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:31:59,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:31:59,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 21:31:59,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:32:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-03-03 21:32:01,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:32:02,079 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:32:02,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474092283] [2025-03-03 21:32:02,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474092283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:32:02,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1588250233] [2025-03-03 21:32:02,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:02,080 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:32:02,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:32:02,082 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:32:02,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-03 21:32:02,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:32:02,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:32:02,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:02,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:02,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 21:32:02,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:32:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 21:32:03,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:32:03,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1588250233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:32:03,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:32:03,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-03-03 21:32:03,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454112045] [2025-03-03 21:32:03,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:32:03,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 21:32:03,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:32:03,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 21:32:03,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:32:03,501 INFO L87 Difference]: Start difference. First operand 148 states and 222 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 21:32:06,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:32:08,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:32:09,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:32:12,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:32:16,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:32:17,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:32:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:32:18,167 INFO L93 Difference]: Finished difference Result 438 states and 642 transitions. [2025-03-03 21:32:18,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 21:32:18,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-03-03 21:32:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:32:18,170 INFO L225 Difference]: With dead ends: 438 [2025-03-03 21:32:18,170 INFO L226 Difference]: Without dead ends: 293 [2025-03-03 21:32:18,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:32:18,176 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 229 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:32:18,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 385 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 259 Invalid, 1 Unknown, 0 Unchecked, 14.6s Time] [2025-03-03 21:32:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-03 21:32:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 283. [2025-03-03 21:32:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 196 states have (on average 1.280612244897959) internal successors, (251), 198 states have internal predecessors, (251), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 79 states have call predecessors, (81), 81 states have call successors, (81) [2025-03-03 21:32:18,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 413 transitions. [2025-03-03 21:32:18,212 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 413 transitions. Word has length 165 [2025-03-03 21:32:18,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:32:18,212 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 413 transitions. [2025-03-03 21:32:18,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 21:32:18,212 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 413 transitions. [2025-03-03 21:32:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 21:32:18,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:32:18,214 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:32:18,230 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 (5)] Ended with exit code 0 [2025-03-03 21:32:18,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2025-03-03 21:32:18,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 21:32:18,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:32:18,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:32:18,616 INFO L85 PathProgramCache]: Analyzing trace with hash 85630779, now seen corresponding path program 1 times [2025-03-03 21:32:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:32:18,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108799252] [2025-03-03 21:32:18,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:18,617 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-03 21:32:18,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:32:18,619 INFO L229 MonitoredProcess]: Starting monitored process 7 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-03 21:32:18,621 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 (7)] Waiting until timeout for monitored process [2025-03-03 21:32:18,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:32:18,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:32:18,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:18,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:18,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 21:32:18,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:32:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-03-03 21:32:21,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:32:21,790 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:32:21,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108799252] [2025-03-03 21:32:21,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108799252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:32:21,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [59380539] [2025-03-03 21:32:21,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:21,790 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:32:21,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:32:21,793 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:32:21,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-03 21:32:21,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:32:22,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:32:22,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:22,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:22,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 21:32:22,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:32:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 21:32:22,219 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:32:22,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [59380539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:32:22,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:32:22,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-03-03 21:32:22,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513714591] [2025-03-03 21:32:22,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:32:22,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:32:22,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:32:22,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:32:22,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-03 21:32:22,220 INFO L87 Difference]: Start difference. First operand 283 states and 413 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 21:32:26,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:32:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:32:26,617 INFO L93 Difference]: Finished difference Result 902 states and 1317 transitions. [2025-03-03 21:32:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 21:32:26,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2025-03-03 21:32:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:32:26,622 INFO L225 Difference]: With dead ends: 902 [2025-03-03 21:32:26,622 INFO L226 Difference]: Without dead ends: 622 [2025-03-03 21:32:26,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 410 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-03-03 21:32:26,623 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 188 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:32:26,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 527 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-03 21:32:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-03-03 21:32:26,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 608. [2025-03-03 21:32:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 431 states have (on average 1.296983758700696) internal successors, (559), 436 states have internal predecessors, (559), 165 states have call successors, (165), 11 states have call predecessors, (165), 11 states have return successors, (165), 160 states have call predecessors, (165), 165 states have call successors, (165) [2025-03-03 21:32:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 889 transitions. [2025-03-03 21:32:26,674 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 889 transitions. Word has length 165 [2025-03-03 21:32:26,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:32:26,675 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 889 transitions. [2025-03-03 21:32:26,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 21:32:26,676 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 889 transitions. [2025-03-03 21:32:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 21:32:26,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:32:26,679 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 21:32:26,695 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 (7)] Ended with exit code 0 [2025-03-03 21:32:26,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-03-03 21:32:27,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 21:32:27,080 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:32:27,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:32:27,081 INFO L85 PathProgramCache]: Analyzing trace with hash 214713498, now seen corresponding path program 1 times [2025-03-03 21:32:27,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:32:27,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154277436] [2025-03-03 21:32:27,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:27,081 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-03 21:32:27,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:32:27,083 INFO L229 MonitoredProcess]: Starting monitored process 9 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-03 21:32:27,084 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 (9)] Waiting until timeout for monitored process [2025-03-03 21:32:27,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:32:27,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:32:27,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:27,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:27,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 21:32:27,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:32:29,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-03-03 21:32:29,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:32:29,985 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:32:29,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154277436] [2025-03-03 21:32:29,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154277436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:32:29,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1246589173] [2025-03-03 21:32:29,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:32:29,985 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 21:32:29,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 21:32:29,987 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 21:32:29,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-03 21:32:30,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 21:32:30,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 21:32:30,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:32:30,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:32:30,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 21:32:30,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:32:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 618 proven. 39 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2025-03-03 21:32:32,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:32:33,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1246589173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:32:33,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:32:33,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-03 21:32:33,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504807265] [2025-03-03 21:32:33,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:32:33,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:32:33,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:32:33,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:32:33,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-03 21:32:33,019 INFO L87 Difference]: Start difference. First operand 608 states and 889 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25)