./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.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 d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:53:47,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:53:47,404 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:53:47,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:53:47,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:53:47,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:53:47,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:53:47,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:53:47,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:53:47,424 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:53:47,424 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:53:47,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:53:47,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:53:47,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:53:47,425 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:53:47,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:53:47,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:53:47,425 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:53:47,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:53:47,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:53:47,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:53:47,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:53:47,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:53:47,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:53:47,426 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:53:47,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:53:47,426 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:53:47,426 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:53:47,426 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:53:47,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:53:47,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:53:47,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:53:47,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:53:47,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:53:47,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:53:47,428 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:53:47,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:53:47,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:53:47,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:53:47,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:53:47,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:53:47,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:53:47,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:53:47,428 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 -> d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 [2025-03-04 00:53:47,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:53:47,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:53:47,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:53:47,641 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:53:47,641 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:53:47,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2025-03-04 00:53:48,770 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a86c101b0/4fd65f093d274b1cb1954603a0693b82/FLAGee0e2176f [2025-03-04 00:53:48,989 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:53:48,990 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2025-03-04 00:53:49,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a86c101b0/4fd65f093d274b1cb1954603a0693b82/FLAGee0e2176f [2025-03-04 00:53:49,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a86c101b0/4fd65f093d274b1cb1954603a0693b82 [2025-03-04 00:53:49,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:53:49,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:53:49,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:53:49,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:53:49,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:53:49,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:53:49" (1/1) ... [2025-03-04 00:53:49,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4ae29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:49, skipping insertion in model container [2025-03-04 00:53:49,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:53:49" (1/1) ... [2025-03-04 00:53:49,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:53:49,432 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_variablewrapping_normal_file-34.i[913,926] [2025-03-04 00:53:49,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:53:49,484 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:53:49,493 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i[913,926] [2025-03-04 00:53:49,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:53:49,532 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:53:49,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:49 WrapperNode [2025-03-04 00:53:49,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:53:49,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:53:49,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:53:49,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:53:49,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:49" (1/1) ... [2025-03-04 00:53:49,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:49" (1/1) ... [2025-03-04 00:53:49,571 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2025-03-04 00:53:49,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:53:49,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:53:49,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:53:49,576 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:53:49,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:49" (1/1) ... [2025-03-04 00:53:49,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:49" (1/1) ... [2025-03-04 00:53:49,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:49" (1/1) ... [2025-03-04 00:53:49,597 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-04 00:53:49,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:49" (1/1) ... [2025-03-04 00:53:49,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:49" (1/1) ... [2025-03-04 00:53:49,603 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:49" (1/1) ... [2025-03-04 00:53:49,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:49" (1/1) ... [2025-03-04 00:53:49,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:49" (1/1) ... [2025-03-04 00:53:49,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:49" (1/1) ... [2025-03-04 00:53:49,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:53:49,611 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:53:49,611 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:53:49,611 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:53:49,615 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:49" (1/1) ... [2025-03-04 00:53:49,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:53:49,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:53:49,637 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-04 00:53:49,641 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-04 00:53:49,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:53:49,669 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:53:49,669 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:53:49,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:53:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:53:49,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:53:49,722 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:53:49,723 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:53:49,900 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:53:49,900 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:53:49,907 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:53:49,909 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:53:49,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:53:49 BoogieIcfgContainer [2025-03-04 00:53:49,910 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:53:49,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:53:49,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:53:49,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:53:49,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:53:49" (1/3) ... [2025-03-04 00:53:49,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6b1dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:53:49, skipping insertion in model container [2025-03-04 00:53:49,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:49" (2/3) ... [2025-03-04 00:53:49,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6b1dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:53:49, skipping insertion in model container [2025-03-04 00:53:49,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:53:49" (3/3) ... [2025-03-04 00:53:49,917 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-34.i [2025-03-04 00:53:49,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:53:49,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-34.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:53:49,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:53:49,982 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;@61c3a87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:53:49,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:53:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:53:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 00:53:49,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:53:49,994 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:53:49,994 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:53:49,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:53:49,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1741941271, now seen corresponding path program 1 times [2025-03-04 00:53:50,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:53:50,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156937063] [2025-03-04 00:53:50,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:53:50,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:53:50,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 00:53:50,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 00:53:50,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:53:50,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:53:50,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-04 00:53:50,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:53:50,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156937063] [2025-03-04 00:53:50,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156937063] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:53:50,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030780497] [2025-03-04 00:53:50,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:53:50,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:53:50,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:53:50,207 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-04 00:53:50,208 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-04 00:53:50,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 00:53:50,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 00:53:50,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:53:50,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:53:50,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:53:50,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:53:50,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-04 00:53:50,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:53:50,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030780497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:53:50,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:53:50,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:53:50,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121511900] [2025-03-04 00:53:50,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:53:50,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:53:50,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:53:50,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:53:50,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:53:50,381 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:53:50,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:53:50,396 INFO L93 Difference]: Finished difference Result 114 states and 198 transitions. [2025-03-04 00:53:50,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:53:50,399 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 141 [2025-03-04 00:53:50,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:53:50,404 INFO L225 Difference]: With dead ends: 114 [2025-03-04 00:53:50,404 INFO L226 Difference]: Without dead ends: 57 [2025-03-04 00:53:50,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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-04 00:53:50,408 INFO L435 NwaCegarLoop]: 85 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, 85 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-04 00:53:50,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:53:50,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-04 00:53:50,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-04 00:53:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:53:50,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2025-03-04 00:53:50,433 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 141 [2025-03-04 00:53:50,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:53:50,433 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2025-03-04 00:53:50,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:53:50,433 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2025-03-04 00:53:50,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 00:53:50,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:53:50,436 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:53:50,442 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-04 00:53:50,636 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-04 00:53:50,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:53:50,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:53:50,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1661787240, now seen corresponding path program 1 times [2025-03-04 00:53:50,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:53:50,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944157170] [2025-03-04 00:53:50,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:53:50,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:53:50,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 00:53:50,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 00:53:50,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:53:50,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:53:52,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:53:52,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:53:52,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944157170] [2025-03-04 00:53:52,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944157170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:53:52,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:53:52,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:53:52,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222331114] [2025-03-04 00:53:52,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:53:52,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:53:52,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:53:52,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:53:52,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:53:52,225 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:53:52,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:53:52,396 INFO L93 Difference]: Finished difference Result 97 states and 134 transitions. [2025-03-04 00:53:52,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:53:52,396 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2025-03-04 00:53:52,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:53:52,398 INFO L225 Difference]: With dead ends: 97 [2025-03-04 00:53:52,398 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 00:53:52,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:53:52,399 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 52 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:53:52,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 390 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:53:52,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 00:53:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2025-03-04 00:53:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:53:52,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2025-03-04 00:53:52,410 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 141 [2025-03-04 00:53:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:53:52,412 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2025-03-04 00:53:52,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:53:52,413 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2025-03-04 00:53:52,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 00:53:52,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:53:52,414 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:53:52,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:53:52,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:53:52,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:53:52,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1745676375, now seen corresponding path program 1 times [2025-03-04 00:53:52,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:53:52,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885387647] [2025-03-04 00:53:52,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:53:52,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:53:52,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 00:53:52,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 00:53:52,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:53:52,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:53:52,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:53:52,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:53:52,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885387647] [2025-03-04 00:53:52,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885387647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:53:52,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:53:52,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:53:52,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481943552] [2025-03-04 00:53:52,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:53:52,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:53:52,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:53:52,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:53:52,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:53:52,497 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:53:52,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:53:52,597 INFO L93 Difference]: Finished difference Result 125 states and 187 transitions. [2025-03-04 00:53:52,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:53:52,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 141 [2025-03-04 00:53:52,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:53:52,599 INFO L225 Difference]: With dead ends: 125 [2025-03-04 00:53:52,599 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 00:53:52,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:53:52,600 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:53:52,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 76 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:53:52,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 00:53:52,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-04 00:53:52,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:53:52,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2025-03-04 00:53:52,613 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 141 [2025-03-04 00:53:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:53:52,613 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2025-03-04 00:53:52,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:53:52,613 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2025-03-04 00:53:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 00:53:52,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:53:52,616 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:53:52,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:53:52,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:53:52,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:53:52,617 INFO L85 PathProgramCache]: Analyzing trace with hash -890369721, now seen corresponding path program 1 times [2025-03-04 00:53:52,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:53:52,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451291853] [2025-03-04 00:53:52,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:53:52,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:53:52,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 00:53:52,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 00:53:52,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:53:52,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:53:52,662 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:53:52,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 00:53:52,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 00:53:52,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:53:52,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:53:52,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:53:52,735 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:53:52,736 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:53:52,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:53:52,740 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 00:53:52,842 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:53:52,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:53:52 BoogieIcfgContainer [2025-03-04 00:53:52,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:53:52,849 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:53:52,849 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:53:52,850 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:53:52,850 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:53:49" (3/4) ... [2025-03-04 00:53:52,852 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:53:52,852 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:53:52,853 INFO L158 Benchmark]: Toolchain (without parser) took 3526.06ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 105.8MB in the beginning and 263.8MB in the end (delta: -158.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:53:52,854 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:53:52,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.08ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 93.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:53:52,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.92ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 90.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:53:52,856 INFO L158 Benchmark]: Boogie Preprocessor took 34.20ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:53:52,856 INFO L158 Benchmark]: IcfgBuilder took 299.31ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 71.0MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:53:52,856 INFO L158 Benchmark]: TraceAbstraction took 2936.70ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 71.0MB in the beginning and 263.8MB in the end (delta: -192.8MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. [2025-03-04 00:53:52,856 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 302.0MB. Free memory was 263.8MB in the beginning and 263.8MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:53:52,857 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.29ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.08ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 93.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.92ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 90.8MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.20ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 88.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 299.31ms. Allocated memory is still 142.6MB. Free memory was 88.8MB in the beginning and 71.0MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2936.70ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 71.0MB in the beginning and 263.8MB in the end (delta: -192.8MB). Peak memory consumption was 132.9MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 302.0MB. Free memory was 263.8MB in the beginning and 263.8MB in the end (delta: 60.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 73. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 16.6; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 1; [L25] double var_1_4 = 10.6; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_7 = 1; [L28] unsigned char var_1_8 = 0; [L29] unsigned char var_1_9 = 0; [L30] signed char var_1_10 = 10; [L31] unsigned char var_1_11 = 100; [L32] unsigned char var_1_12 = 64; [L33] unsigned char var_1_13 = 100; [L34] signed char var_1_14 = -4; [L35] signed char var_1_15 = 32; [L36] signed char var_1_16 = 4; [L37] signed char var_1_17 = 64; [L38] unsigned char last_1_var_1_5 = 0; VAL [isInitial=0, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=1, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=1, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L67] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L68] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L69] var_1_3 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L70] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L71] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L72] var_1_4 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L73] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L74] var_1_7 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L75] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L77] var_1_8 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0] [L82] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L83] var_1_11 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_11 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not(var_1_11 <= 128) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L86] var_1_12 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_12 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_12 >= 64) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L89] var_1_13 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L92] var_1_14 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L95] var_1_15 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_15 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_15 >= -63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L98] var_1_16 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L114] RET updateVariables() [L115] CALL step() [L42] COND FALSE !(\read(last_1_var_1_5)) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L47] COND FALSE !(var_1_1 >= (- (var_1_4 * var_1_1))) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L50] COND TRUE var_1_3 || (256 >= (var_1_17 + 4)) [L51] var_1_5 = ((var_1_2 || var_1_3) || var_1_7) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L55] signed long int stepLocal_1 = (var_1_11 + var_1_12) - ((((var_1_13) < (1)) ? (var_1_13) : (1))); [L56] signed char stepLocal_0 = var_1_17; VAL [isInitial=1, last_1_var_1_5=0, stepLocal_0=64, stepLocal_1=191, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L57] COND FALSE !(-10 >= stepLocal_0) VAL [isInitial=1, last_1_var_1_5=0, stepLocal_1=191, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return (((last_1_var_1_5 ? (last_1_var_1_5 ? (var_1_1 == ((double) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : 1) : 1) && ((var_1_3 || (256 >= (var_1_17 + 4))) ? (var_1_5 == ((unsigned char) ((var_1_2 || var_1_3) || var_1_7))) : (var_1_5 == ((unsigned char) (! (! (var_1_8 || var_1_9))))))) && ((-10 >= var_1_17) ? ((((var_1_11 + var_1_12) - ((((var_1_13) < (1)) ? (var_1_13) : (1)))) > (~ var_1_17)) ? (var_1_10 == ((signed char) (var_1_14 + var_1_15))) : (var_1_10 == ((signed char) var_1_16))) : 1)) && ((var_1_1 >= (- (var_1_4 * var_1_1))) ? (var_1_17 == ((signed char) var_1_15)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=128, var_1_12=64, var_1_13=127, var_1_14=62, var_1_15=-63, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 551 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 313 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 238 mSDtfsCounter, 91 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 31 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 705 NumberOfCodeBlocks, 705 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 560 ConstructedInterpolants, 0 QuantifiedInterpolants, 787 SizeOfPredicates, 0 NumberOfNonLiveVariables, 311 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 4004/4048 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-04 00:53:52,874 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_variablewrapping_normal_file-34.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 d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:53:54,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:53:54,659 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:53:54,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:53:54,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:53:54,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:53:54,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:53:54,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:53:54,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:53:54,707 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:53:54,707 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:53:54,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:53:54,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:53:54,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:53:54,709 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:53:54,710 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:53:54,710 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:53:54,710 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:53:54,714 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:53:54,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:53:54,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:53:54,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:53:54,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:53:54,717 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:53:54,717 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:53:54,718 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:53:54,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:53:54,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:53:54,718 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 -> d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 [2025-03-04 00:53:54,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:53:54,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:53:54,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:53:54,933 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:53:54,933 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:53:54,935 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2025-03-04 00:53:56,092 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c779bcfa/23966664ac4244599294cb4bb80fad82/FLAG95c0052c1 [2025-03-04 00:53:56,324 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:53:56,324 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2025-03-04 00:53:56,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c779bcfa/23966664ac4244599294cb4bb80fad82/FLAG95c0052c1 [2025-03-04 00:53:56,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c779bcfa/23966664ac4244599294cb4bb80fad82 [2025-03-04 00:53:56,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:53:56,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:53:56,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:53:56,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:53:56,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:53:56,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:53:56" (1/1) ... [2025-03-04 00:53:56,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@656af71b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:56, skipping insertion in model container [2025-03-04 00:53:56,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:53:56" (1/1) ... [2025-03-04 00:53:56,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:53:56,471 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_variablewrapping_normal_file-34.i[913,926] [2025-03-04 00:53:56,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:53:56,527 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:53:56,536 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_variablewrapping_normal_file-34.i[913,926] [2025-03-04 00:53:56,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:53:56,576 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:53:56,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:56 WrapperNode [2025-03-04 00:53:56,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:53:56,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:53:56,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:53:56,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:53:56,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:56" (1/1) ... [2025-03-04 00:53:56,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:56" (1/1) ... [2025-03-04 00:53:56,616 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-03-04 00:53:56,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:53:56,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:53:56,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:53:56,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:53:56,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:56" (1/1) ... [2025-03-04 00:53:56,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:56" (1/1) ... [2025-03-04 00:53:56,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:56" (1/1) ... [2025-03-04 00:53:56,641 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:53:56,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:56" (1/1) ... [2025-03-04 00:53:56,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:56" (1/1) ... [2025-03-04 00:53:56,649 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:56" (1/1) ... [2025-03-04 00:53:56,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:56" (1/1) ... [2025-03-04 00:53:56,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:56" (1/1) ... [2025-03-04 00:53:56,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:56" (1/1) ... [2025-03-04 00:53:56,656 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:53:56,660 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:53:56,660 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:53:56,660 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:53:56,661 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:56" (1/1) ... [2025-03-04 00:53:56,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:53:56,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:53:56,690 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-04 00:53:56,692 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-04 00:53:56,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:53:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:53:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:53:56,710 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:53:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:53:56,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:53:56,760 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:53:56,762 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:54:00,729 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:54:00,729 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:54:00,735 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:54:00,736 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:54:00,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:54:00 BoogieIcfgContainer [2025-03-04 00:54:00,736 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:54:00,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:54:00,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:54:00,741 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:54:00,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:53:56" (1/3) ... [2025-03-04 00:54:00,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6ad125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:54:00, skipping insertion in model container [2025-03-04 00:54:00,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:53:56" (2/3) ... [2025-03-04 00:54:00,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6ad125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:54:00, skipping insertion in model container [2025-03-04 00:54:00,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:54:00" (3/3) ... [2025-03-04 00:54:00,746 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-34.i [2025-03-04 00:54:00,755 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:54:00,755 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-34.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:54:00,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:54:00,800 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;@19c56c88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:54:00,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:54:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:54:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 00:54:00,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:54:00,809 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:54:00,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:54:00,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:54:00,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1741941271, now seen corresponding path program 1 times [2025-03-04 00:54:00,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:54:00,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859638185] [2025-03-04 00:54:00,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:54:00,820 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-04 00:54:00,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:54:00,822 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-04 00:54:00,823 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-04 00:54:00,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 00:54:01,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 00:54:01,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:54:01,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:54:01,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:54:01,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:54:01,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2025-03-04 00:54:01,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:54:01,150 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:54:01,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859638185] [2025-03-04 00:54:01,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859638185] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:54:01,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:54:01,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:54:01,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958139906] [2025-03-04 00:54:01,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:54:01,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:54:01,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:54:01,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:54:01,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:54:01,171 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:54:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:54:01,186 INFO L93 Difference]: Finished difference Result 114 states and 198 transitions. [2025-03-04 00:54:01,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:54:01,187 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 141 [2025-03-04 00:54:01,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:54:01,191 INFO L225 Difference]: With dead ends: 114 [2025-03-04 00:54:01,191 INFO L226 Difference]: Without dead ends: 57 [2025-03-04 00:54:01,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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-04 00:54:01,195 INFO L435 NwaCegarLoop]: 84 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, 84 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-04 00:54:01,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:54:01,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-04 00:54:01,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-04 00:54:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:54:01,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2025-03-04 00:54:01,225 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 141 [2025-03-04 00:54:01,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:54:01,225 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-03-04 00:54:01,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:54:01,225 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2025-03-04 00:54:01,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 00:54:01,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:54:01,230 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:54:01,240 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-04 00:54:01,431 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-04 00:54:01,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:54:01,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:54:01,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1661787240, now seen corresponding path program 1 times [2025-03-04 00:54:01,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:54:01,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556633950] [2025-03-04 00:54:01,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:54:01,433 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-04 00:54:01,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:54:01,435 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-04 00:54:01,437 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-04 00:54:01,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 00:54:01,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 00:54:01,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:54:01,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:54:01,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 00:54:01,698 INFO L279 TraceCheckSpWp]: Computing forward predicates...