./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.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 0bb8b5663ba2dc071251b4140110d0fdb4bbd97b62df4eade29867521161d85e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:35:09,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:35:09,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:35:09,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:35:09,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:35:09,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:35:09,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:35:09,404 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:35:09,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:35:09,404 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:35:09,405 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:35:09,405 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:35:09,405 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:35:09,405 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:35:09,405 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:35:09,406 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:35:09,406 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:35:09,406 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:35:09,406 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:35:09,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:35:09,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:35:09,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:35:09,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:35:09,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:35:09,406 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:35:09,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:35:09,407 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:35:09,407 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:35:09,407 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:35:09,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:35:09,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:35:09,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:35:09,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:35:09,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:35:09,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:35:09,408 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:35:09,408 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:35:09,408 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:35:09,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:35:09,408 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:35:09,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:35:09,408 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:35:09,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:35:09,408 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 -> 0bb8b5663ba2dc071251b4140110d0fdb4bbd97b62df4eade29867521161d85e [2025-03-08 15:35:09,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:35:09,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:35:09,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:35:09,626 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:35:09,626 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:35:09,628 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i [2025-03-08 15:35:10,767 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc5c8d5b/80f587e7b74a49afa9301de879ad631a/FLAGaf1a743aa [2025-03-08 15:35:11,023 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:35:11,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i [2025-03-08 15:35:11,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc5c8d5b/80f587e7b74a49afa9301de879ad631a/FLAGaf1a743aa [2025-03-08 15:35:11,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bc5c8d5b/80f587e7b74a49afa9301de879ad631a [2025-03-08 15:35:11,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:35:11,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:35:11,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:35:11,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:35:11,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:35:11,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:35:11" (1/1) ... [2025-03-08 15:35:11,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ccf8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:11, skipping insertion in model container [2025-03-08 15:35:11,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:35:11" (1/1) ... [2025-03-08 15:35:11,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:35:11,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_operatoramount_amount25_file-59.i[915,928] [2025-03-08 15:35:11,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:35:11,510 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:35:11,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i[915,928] [2025-03-08 15:35:11,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:35:11,546 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:35:11,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:11 WrapperNode [2025-03-08 15:35:11,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:35:11,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:35:11,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:35:11,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:35:11,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:11" (1/1) ... [2025-03-08 15:35:11,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:11" (1/1) ... [2025-03-08 15:35:11,578 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2025-03-08 15:35:11,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:35:11,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:35:11,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:35:11,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:35:11,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:11" (1/1) ... [2025-03-08 15:35:11,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:11" (1/1) ... [2025-03-08 15:35:11,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:11" (1/1) ... [2025-03-08 15:35:11,595 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:35:11,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:11" (1/1) ... [2025-03-08 15:35:11,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:11" (1/1) ... [2025-03-08 15:35:11,598 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:11" (1/1) ... [2025-03-08 15:35:11,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:11" (1/1) ... [2025-03-08 15:35:11,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:11" (1/1) ... [2025-03-08 15:35:11,600 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:11" (1/1) ... [2025-03-08 15:35:11,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:35:11,602 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:35:11,602 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:35:11,602 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:35:11,603 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:11" (1/1) ... [2025-03-08 15:35:11,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:35:11,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:35:11,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:35:11,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:35:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:35:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:35:11,650 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:35:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:35:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:35:11,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:35:11,706 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:35:11,707 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:35:11,907 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 15:35:11,910 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:35:11,919 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:35:11,919 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:35:11,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:35:11 BoogieIcfgContainer [2025-03-08 15:35:11,920 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:35:11,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:35:11,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:35:11,927 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:35:11,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:35:11" (1/3) ... [2025-03-08 15:35:11,927 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e14c891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:35:11, skipping insertion in model container [2025-03-08 15:35:11,927 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:11" (2/3) ... [2025-03-08 15:35:11,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e14c891 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:35:11, skipping insertion in model container [2025-03-08 15:35:11,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:35:11" (3/3) ... [2025-03-08 15:35:11,928 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-59.i [2025-03-08 15:35:11,940 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:35:11,942 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-59.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:35:11,990 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:35:12,002 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;@72b9df48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:35:12,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:35:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 15:35:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 15:35:12,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:35:12,017 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:35:12,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:35:12,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:35:12,023 INFO L85 PathProgramCache]: Analyzing trace with hash -331961269, now seen corresponding path program 1 times [2025-03-08 15:35:12,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:35:12,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143815253] [2025-03-08 15:35:12,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:12,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:35:12,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 15:35:12,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 15:35:12,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:12,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:35:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-08 15:35:12,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:35:12,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143815253] [2025-03-08 15:35:12,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143815253] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:35:12,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366324856] [2025-03-08 15:35:12,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:12,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:35:12,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:35:12,213 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:35:12,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:35:12,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 15:35:12,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 15:35:12,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:12,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:35:12,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:35:12,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:35:12,386 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-08 15:35:12,388 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:35:12,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366324856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:35:12,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:35:12,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:35:12,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071046473] [2025-03-08 15:35:12,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:35:12,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:35:12,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:35:12,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:35:12,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:35:12,411 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 15:35:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:35:12,425 INFO L93 Difference]: Finished difference Result 112 states and 188 transitions. [2025-03-08 15:35:12,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:35:12,427 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2025-03-08 15:35:12,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:35:12,431 INFO L225 Difference]: With dead ends: 112 [2025-03-08 15:35:12,431 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 15:35:12,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:35:12,435 INFO L435 NwaCegarLoop]: 80 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, 80 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:35:12,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:35:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 15:35:12,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-08 15:35:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 15:35:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2025-03-08 15:35:12,463 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 132 [2025-03-08 15:35:12,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:35:12,463 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2025-03-08 15:35:12,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 15:35:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2025-03-08 15:35:12,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 15:35:12,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:35:12,465 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:35:12,471 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-08 15:35:12,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:35:12,666 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:35:12,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:35:12,667 INFO L85 PathProgramCache]: Analyzing trace with hash 502455556, now seen corresponding path program 1 times [2025-03-08 15:35:12,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:35:12,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492786582] [2025-03-08 15:35:12,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:12,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:35:12,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 15:35:12,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 15:35:12,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:12,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:35:12,988 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 15:35:12,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:35:12,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492786582] [2025-03-08 15:35:12,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492786582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:35:12,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:35:12,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:35:12,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831908620] [2025-03-08 15:35:12,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:35:12,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:35:12,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:35:12,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:35:12,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:35:12,990 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 15:35:13,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:35:13,015 INFO L93 Difference]: Finished difference Result 109 states and 157 transitions. [2025-03-08 15:35:13,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:35:13,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2025-03-08 15:35:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:35:13,017 INFO L225 Difference]: With dead ends: 109 [2025-03-08 15:35:13,017 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 15:35:13,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:35:13,018 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:35:13,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:35:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 15:35:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-08 15:35:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 15:35:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2025-03-08 15:35:13,029 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 132 [2025-03-08 15:35:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:35:13,031 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2025-03-08 15:35:13,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 15:35:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2025-03-08 15:35:13,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 15:35:13,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:35:13,033 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:35:13,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:35:13,033 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:35:13,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:35:13,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1574132735, now seen corresponding path program 1 times [2025-03-08 15:35:13,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:35:13,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003006376] [2025-03-08 15:35:13,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:13,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:35:13,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 15:35:13,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 15:35:13,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:13,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:35:13,136 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:35:13,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 15:35:13,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 15:35:13,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:13,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:35:13,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:35:13,246 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:35:13,246 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:35:13,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:35:13,250 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 15:35:13,333 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:35:13,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:35:13 BoogieIcfgContainer [2025-03-08 15:35:13,338 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:35:13,338 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:35:13,338 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:35:13,339 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:35:13,339 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:35:11" (3/4) ... [2025-03-08 15:35:13,341 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:35:13,341 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:35:13,342 INFO L158 Benchmark]: Toolchain (without parser) took 1994.29ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 51.4MB in the end (delta: 70.9MB). Peak memory consumption was 73.1MB. Max. memory is 16.1GB. [2025-03-08 15:35:13,342 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:35:13,343 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.56ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 109.4MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:35:13,343 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.15ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:35:13,343 INFO L158 Benchmark]: Boogie Preprocessor took 21.28ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 105.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:35:13,344 INFO L158 Benchmark]: IcfgBuilder took 317.61ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 89.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 15:35:13,344 INFO L158 Benchmark]: TraceAbstraction took 1416.57ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 52.3MB in the end (delta: 36.9MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2025-03-08 15:35:13,344 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 167.8MB. Free memory was 52.3MB in the beginning and 51.4MB in the end (delta: 874.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:35:13,345 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.22ms. Allocated memory is still 201.3MB. Free memory is still 120.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.56ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 109.4MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.15ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.6MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.28ms. Allocated memory is still 167.8MB. Free memory was 107.6MB in the beginning and 105.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 317.61ms. Allocated memory is still 167.8MB. Free memory was 105.7MB in the beginning and 89.8MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1416.57ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 52.3MB in the end (delta: 36.9MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 167.8MB. Free memory was 52.3MB in the beginning and 51.4MB in the end (delta: 874.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 someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryArithmeticFLOAToperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -128; [L23] signed long int var_1_4 = -32; [L24] signed long int var_1_5 = 10; [L25] signed long int var_1_6 = -1; [L26] unsigned long int var_1_7 = 25; [L27] unsigned char var_1_8 = 1; [L28] unsigned long int var_1_9 = 2; [L29] unsigned long int var_1_10 = 32; [L30] unsigned long int var_1_11 = 128; [L31] float var_1_12 = 24.2; [L32] double var_1_13 = 999999999999999.2; [L33] double var_1_14 = 9999999.6; [L34] double var_1_15 = 9.75; [L35] float var_1_16 = 999999999999999.4; [L36] float var_1_17 = 256.6; [L37] float var_1_18 = 8.875; [L38] float var_1_19 = 256.25; [L39] signed long int last_1_var_1_1 = -128; [L40] unsigned long int last_1_var_1_7 = 25; VAL [isInitial=0, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-32, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] CALL updateLastVariables() [L107] last_1_var_1_1 = var_1_1 [L108] last_1_var_1_7 = var_1_7 VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-32, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L118] RET updateLastVariables() [L119] CALL updateVariables() [L70] var_1_4 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_4 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L71] RET assume_abort_if_not(var_1_4 >= -536870911) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L72] CALL assume_abort_if_not(var_1_4 <= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L72] RET assume_abort_if_not(var_1_4 <= 536870912) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L73] var_1_5 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_5 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L74] RET assume_abort_if_not(var_1_5 >= -536870911) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L75] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L75] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L76] var_1_6 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_6 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=1, var_1_9=2] [L77] RET assume_abort_if_not(var_1_6 >= -1073741823) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=1, var_1_9=2] [L78] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=1, var_1_9=2] [L78] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=1, var_1_9=2] [L79] var_1_8 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_9=2] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_9=2] [L81] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=2] [L81] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=2] [L82] var_1_9 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0] [L83] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0] [L84] CALL assume_abort_if_not(var_1_9 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L84] RET assume_abort_if_not(var_1_9 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L85] var_1_10 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L86] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L87] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L87] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L88] var_1_11 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L89] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L90] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L90] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L91] var_1_13 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L92] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L93] var_1_14 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L94] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L95] var_1_15 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L96] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L97] var_1_16 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L98] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L99] var_1_17 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L100] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L101] var_1_18 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L102] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L103] var_1_19 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L104] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L119] RET updateVariables() [L120] CALL step() [L44] COND TRUE ((((last_1_var_1_7) > (1)) ? (last_1_var_1_7) : (1))) <= (256 + last_1_var_1_1) [L45] var_1_1 = ((var_1_4 + var_1_5) + var_1_6) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_1=0, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L49] COND FALSE !(\read(var_1_8)) [L56] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_1=0, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=4294967294, var_1_8=0, var_1_9=4294967293] [L58] unsigned long int stepLocal_0 = var_1_7; VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, stepLocal_0=4294967294, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_1=0, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=4294967294, var_1_8=0, var_1_9=4294967293] [L59] COND TRUE var_1_7 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_1=0, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=4294967294, var_1_8=0, var_1_9=4294967293] [L60] COND TRUE (var_1_13 - var_1_14) == var_1_15 [L61] var_1_12 = ((((var_1_16) > (((var_1_17 + var_1_18) - var_1_19))) ? (var_1_16) : (((var_1_17 + var_1_18) - var_1_19)))) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=4294967294, var_1_8=0, var_1_9=4294967293] [L120] RET step() [L121] CALL, EXPR property() [L111-L112] return (((((((last_1_var_1_7) > (1)) ? (last_1_var_1_7) : (1))) <= (256 + last_1_var_1_1)) ? (var_1_1 == ((signed long int) ((var_1_4 + var_1_5) + var_1_6))) : (var_1_1 == ((signed long int) var_1_6))) && (var_1_8 ? ((var_1_1 <= var_1_1) ? (var_1_7 == ((unsigned long int) ((((var_1_9) > (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))) ? (var_1_9) : (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))))) : (var_1_7 == ((unsigned long int) var_1_10))) : (var_1_7 == ((unsigned long int) var_1_11)))) && ((var_1_7 <= var_1_7) ? (((var_1_13 - var_1_14) == var_1_15) ? (var_1_12 == ((float) ((((var_1_16) > (((var_1_17 + var_1_18) - var_1_19))) ? (var_1_16) : (((var_1_17 + var_1_18) - var_1_19)))))) : (var_1_12 == ((float) var_1_19))) : (var_1_12 == ((float) var_1_16))) ; VAL [\result=0, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=4294967294, var_1_8=0, var_1_9=4294967293] [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=4294967294, var_1_8=0, var_1_9=4294967293] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=4294967294, var_1_8=0, var_1_9=4294967293] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 107 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 158 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 529 NumberOfCodeBlocks, 529 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 300 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2480/2520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 15:35:13,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 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_operatoramount_amount25_file-59.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 0bb8b5663ba2dc071251b4140110d0fdb4bbd97b62df4eade29867521161d85e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:35:15,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:35:15,338 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:35:15,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:35:15,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:35:15,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:35:15,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:35:15,361 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:35:15,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:35:15,361 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:35:15,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:35:15,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:35:15,361 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:35:15,361 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:35:15,361 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:35:15,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:35:15,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:35:15,362 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:35:15,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:35:15,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:35:15,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:35:15,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:35:15,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:35:15,362 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:35:15,362 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:35:15,362 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:35:15,362 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:35:15,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:35:15,362 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:35:15,362 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:35:15,362 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:35:15,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:35:15,362 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:35:15,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:35:15,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:35:15,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:35:15,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:35:15,365 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:35:15,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:35:15,365 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:35:15,365 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:35:15,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:35:15,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:35:15,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:35:15,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:35:15,365 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 -> 0bb8b5663ba2dc071251b4140110d0fdb4bbd97b62df4eade29867521161d85e [2025-03-08 15:35:15,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:35:15,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:35:15,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:35:15,711 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:35:15,712 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:35:15,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i [2025-03-08 15:35:16,893 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5baa076e9/437ab330a733430b95228d777c690aef/FLAG4aa8488ee [2025-03-08 15:35:17,120 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:35:17,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i [2025-03-08 15:35:17,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5baa076e9/437ab330a733430b95228d777c690aef/FLAG4aa8488ee [2025-03-08 15:35:17,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5baa076e9/437ab330a733430b95228d777c690aef [2025-03-08 15:35:17,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:35:17,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:35:17,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:35:17,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:35:17,147 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:35:17,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:35:17" (1/1) ... [2025-03-08 15:35:17,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b6b412f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:17, skipping insertion in model container [2025-03-08 15:35:17,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:35:17" (1/1) ... [2025-03-08 15:35:17,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:35:17,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i[915,928] [2025-03-08 15:35:17,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:35:17,292 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:35:17,299 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i[915,928] [2025-03-08 15:35:17,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:35:17,325 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:35:17,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:17 WrapperNode [2025-03-08 15:35:17,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:35:17,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:35:17,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:35:17,327 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:35:17,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:17" (1/1) ... [2025-03-08 15:35:17,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:17" (1/1) ... [2025-03-08 15:35:17,363 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2025-03-08 15:35:17,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:35:17,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:35:17,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:35:17,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:35:17,370 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:17" (1/1) ... [2025-03-08 15:35:17,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:17" (1/1) ... [2025-03-08 15:35:17,372 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:17" (1/1) ... [2025-03-08 15:35:17,384 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:35:17,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:17" (1/1) ... [2025-03-08 15:35:17,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:17" (1/1) ... [2025-03-08 15:35:17,389 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:17" (1/1) ... [2025-03-08 15:35:17,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:17" (1/1) ... [2025-03-08 15:35:17,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:17" (1/1) ... [2025-03-08 15:35:17,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:17" (1/1) ... [2025-03-08 15:35:17,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:35:17,395 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:35:17,395 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:35:17,396 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:35:17,396 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:17" (1/1) ... [2025-03-08 15:35:17,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:35:17,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:35:17,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:35:17,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:35:17,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:35:17,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:35:17,448 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:35:17,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:35:17,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:35:17,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:35:17,507 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:35:17,509 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:35:19,442 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 15:35:19,443 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:35:19,449 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:35:19,450 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:35:19,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:35:19 BoogieIcfgContainer [2025-03-08 15:35:19,452 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:35:19,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:35:19,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:35:19,458 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:35:19,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:35:17" (1/3) ... [2025-03-08 15:35:19,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f17fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:35:19, skipping insertion in model container [2025-03-08 15:35:19,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:35:17" (2/3) ... [2025-03-08 15:35:19,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f17fa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:35:19, skipping insertion in model container [2025-03-08 15:35:19,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:35:19" (3/3) ... [2025-03-08 15:35:19,460 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-59.i [2025-03-08 15:35:19,469 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:35:19,470 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-59.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:35:19,505 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:35:19,515 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;@10558a40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:35:19,516 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:35:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 15:35:19,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 15:35:19,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:35:19,531 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:35:19,531 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:35:19,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:35:19,535 INFO L85 PathProgramCache]: Analyzing trace with hash -331961269, now seen corresponding path program 1 times [2025-03-08 15:35:19,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:35:19,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673190965] [2025-03-08 15:35:19,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:19,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:35:19,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:35:19,544 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:35:19,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 15:35:19,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 15:35:19,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 15:35:19,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:19,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:35:19,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:35:19,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:35:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2025-03-08 15:35:19,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:35:19,877 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:35:19,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673190965] [2025-03-08 15:35:19,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673190965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:35:19,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:35:19,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:35:19,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291493508] [2025-03-08 15:35:19,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:35:19,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:35:19,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:35:19,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:35:19,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:35:19,911 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 15:35:19,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:35:19,933 INFO L93 Difference]: Finished difference Result 112 states and 188 transitions. [2025-03-08 15:35:19,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:35:19,935 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2025-03-08 15:35:19,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:35:19,940 INFO L225 Difference]: With dead ends: 112 [2025-03-08 15:35:19,940 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 15:35:19,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:35:19,946 INFO L435 NwaCegarLoop]: 80 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, 80 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:35:19,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:35:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 15:35:19,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-08 15:35:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 15:35:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2025-03-08 15:35:19,978 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 132 [2025-03-08 15:35:19,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:35:19,979 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2025-03-08 15:35:19,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 15:35:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2025-03-08 15:35:19,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 15:35:19,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:35:19,981 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:35:19,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 15:35:20,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:35:20,186 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:35:20,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:35:20,187 INFO L85 PathProgramCache]: Analyzing trace with hash 502455556, now seen corresponding path program 1 times [2025-03-08 15:35:20,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:35:20,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555900083] [2025-03-08 15:35:20,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:20,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:35:20,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:35:20,190 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:35:20,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 15:35:20,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 15:35:20,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 15:35:20,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:20,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:35:20,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 15:35:20,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:35:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 15:35:20,520 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:35:20,520 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:35:20,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555900083] [2025-03-08 15:35:20,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555900083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:35:20,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:35:20,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:35:20,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124966913] [2025-03-08 15:35:20,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:35:20,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:35:20,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:35:20,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:35:20,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:35:20,522 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 15:35:21,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:35:21,115 INFO L93 Difference]: Finished difference Result 109 states and 157 transitions. [2025-03-08 15:35:21,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:35:21,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2025-03-08 15:35:21,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:35:21,130 INFO L225 Difference]: With dead ends: 109 [2025-03-08 15:35:21,130 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 15:35:21,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:35:21,131 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 15:35:21,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 15:35:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 15:35:21,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-08 15:35:21,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 15:35:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2025-03-08 15:35:21,137 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 132 [2025-03-08 15:35:21,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:35:21,138 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2025-03-08 15:35:21,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 15:35:21,139 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2025-03-08 15:35:21,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 15:35:21,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:35:21,140 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:35:21,150 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-08 15:35:21,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-08 15:35:21,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:35:21,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:35:21,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1574132735, now seen corresponding path program 1 times [2025-03-08 15:35:21,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:35:21,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606638942] [2025-03-08 15:35:21,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:35:21,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 15:35:21,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:35:21,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 15:35:21,345 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 (4)] Waiting until timeout for monitored process [2025-03-08 15:35:21,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 15:35:21,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 15:35:21,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:35:21,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:35:21,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-08 15:35:21,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:36:14,216 WARN L286 SmtUtils]: Spent 13.86s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)