./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-10.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 276665dc6e625a61dc2ccb3f599e36b7d7e4c6f98ac725a766d4de866c89eedf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:08:01,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:08:01,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:08:01,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:08:01,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:08:01,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:08:01,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:08:01,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:08:01,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:08:01,431 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:08:01,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:08:01,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:08:01,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:08:01,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:08:01,432 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:08:01,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:08:01,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:08:01,433 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:08:01,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:08:01,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:08:01,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:08:01,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:08:01,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:08:01,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:08:01,433 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:08:01,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:08:01,434 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:08:01,434 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:08:01,434 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:08:01,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:08:01,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:08:01,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:08:01,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:08:01,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:08:01,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:08:01,435 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:08:01,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:08:01,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:08:01,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:08:01,435 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:08:01,435 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:08:01,435 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:08:01,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:08:01,436 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 -> 276665dc6e625a61dc2ccb3f599e36b7d7e4c6f98ac725a766d4de866c89eedf [2025-03-17 05:08:01,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:08:01,678 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:08:01,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:08:01,681 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:08:01,681 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:08:01,682 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-10.i [2025-03-17 05:08:02,931 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac26ce639/68bb40bc52414023bf932b3da3466882/FLAGa9bf05c6e [2025-03-17 05:08:03,178 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:08:03,179 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.i [2025-03-17 05:08:03,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac26ce639/68bb40bc52414023bf932b3da3466882/FLAGa9bf05c6e [2025-03-17 05:08:03,501 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac26ce639/68bb40bc52414023bf932b3da3466882 [2025-03-17 05:08:03,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:08:03,505 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:08:03,506 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:08:03,506 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:08:03,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:08:03,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:08:03" (1/1) ... [2025-03-17 05:08:03,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a14ac37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:03, skipping insertion in model container [2025-03-17 05:08:03,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:08:03" (1/1) ... [2025-03-17 05:08:03,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:08:03,645 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-10.i[913,926] [2025-03-17 05:08:03,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:08:03,699 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:08:03,706 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-10.i[913,926] [2025-03-17 05:08:03,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:08:03,737 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:08:03,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:03 WrapperNode [2025-03-17 05:08:03,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:08:03,738 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:08:03,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:08:03,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:08:03,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:03" (1/1) ... [2025-03-17 05:08:03,746 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:03" (1/1) ... [2025-03-17 05:08:03,768 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2025-03-17 05:08:03,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:08:03,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:08:03,772 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:08:03,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:08:03,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:03" (1/1) ... [2025-03-17 05:08:03,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:03" (1/1) ... [2025-03-17 05:08:03,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:03" (1/1) ... [2025-03-17 05:08:03,796 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-17 05:08:03,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:03" (1/1) ... [2025-03-17 05:08:03,800 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:03" (1/1) ... [2025-03-17 05:08:03,804 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:03" (1/1) ... [2025-03-17 05:08:03,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:03" (1/1) ... [2025-03-17 05:08:03,808 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:03" (1/1) ... [2025-03-17 05:08:03,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:03" (1/1) ... [2025-03-17 05:08:03,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:08:03,813 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:08:03,814 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:08:03,814 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:08:03,814 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:03" (1/1) ... [2025-03-17 05:08:03,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:08:03,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:08:03,842 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-17 05:08:03,844 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-17 05:08:03,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:08:03,864 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:08:03,865 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:08:03,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:08:03,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:08:03,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:08:03,919 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:08:03,920 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:08:04,135 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 05:08:04,135 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:08:04,146 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:08:04,147 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:08:04,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:08:04 BoogieIcfgContainer [2025-03-17 05:08:04,147 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:08:04,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:08:04,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:08:04,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:08:04,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:08:03" (1/3) ... [2025-03-17 05:08:04,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a65aace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:08:04, skipping insertion in model container [2025-03-17 05:08:04,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:03" (2/3) ... [2025-03-17 05:08:04,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a65aace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:08:04, skipping insertion in model container [2025-03-17 05:08:04,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:08:04" (3/3) ... [2025-03-17 05:08:04,162 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-10.i [2025-03-17 05:08:04,179 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:08:04,182 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-10.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:08:04,237 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:08:04,247 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;@4ee075ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:08:04,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:08:04,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:08:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:08:04,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:08:04,262 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:08:04,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:08:04,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:08:04,269 INFO L85 PathProgramCache]: Analyzing trace with hash 641640895, now seen corresponding path program 1 times [2025-03-17 05:08:04,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:08:04,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270914138] [2025-03-17 05:08:04,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:08:04,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:08:04,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:08:04,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:08:04,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:08:04,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:08:04,554 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 05:08:04,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:08:04,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270914138] [2025-03-17 05:08:04,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270914138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:08:04,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119408266] [2025-03-17 05:08:04,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:08:04,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:08:04,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:08:04,559 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-17 05:08:04,560 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-17 05:08:04,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:08:04,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:08:04,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:08:04,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:08:04,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:08:04,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:08:04,725 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 05:08:04,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:08:04,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119408266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:08:04,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:08:04,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:08:04,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257784764] [2025-03-17 05:08:04,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:08:04,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:08:04,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:08:04,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:08:04,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:08:04,745 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:08:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:08:04,761 INFO L93 Difference]: Finished difference Result 93 states and 161 transitions. [2025-03-17 05:08:04,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:08:04,763 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 115 [2025-03-17 05:08:04,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:08:04,767 INFO L225 Difference]: With dead ends: 93 [2025-03-17 05:08:04,767 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 05:08:04,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 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-17 05:08:04,771 INFO L435 NwaCegarLoop]: 68 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, 68 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-17 05:08:04,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:08:04,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 05:08:04,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 05:08:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:08:04,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2025-03-17 05:08:04,801 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 115 [2025-03-17 05:08:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:08:04,801 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2025-03-17 05:08:04,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:08:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2025-03-17 05:08:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:08:04,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:08:04,804 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:08:04,811 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-17 05:08:05,005 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-17 05:08:05,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:08:05,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:08:05,006 INFO L85 PathProgramCache]: Analyzing trace with hash -782496612, now seen corresponding path program 1 times [2025-03-17 05:08:05,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:08:05,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867733275] [2025-03-17 05:08:05,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:08:05,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:08:05,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:08:05,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:08:05,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:08:05,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:08:05,146 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:08:05,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:08:05,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:08:05,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:08:05,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:08:05,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:08:05,255 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:08:05,256 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:08:05,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:08:05,259 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 05:08:05,344 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:08:05,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:08:05 BoogieIcfgContainer [2025-03-17 05:08:05,351 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:08:05,352 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:08:05,353 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:08:05,353 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:08:05,354 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:08:04" (3/4) ... [2025-03-17 05:08:05,355 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:08:05,357 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:08:05,357 INFO L158 Benchmark]: Toolchain (without parser) took 1852.58ms. Allocated memory is still 201.3MB. Free memory was 152.9MB in the beginning and 147.5MB in the end (delta: 5.4MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2025-03-17 05:08:05,357 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:08:05,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.86ms. Allocated memory is still 201.3MB. Free memory was 152.9MB in the beginning and 140.0MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:08:05,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.08ms. Allocated memory is still 201.3MB. Free memory was 140.0MB in the beginning and 138.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:08:05,358 INFO L158 Benchmark]: Boogie Preprocessor took 40.31ms. Allocated memory is still 201.3MB. Free memory was 138.0MB in the beginning and 135.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:08:05,360 INFO L158 Benchmark]: IcfgBuilder took 333.92ms. Allocated memory is still 201.3MB. Free memory was 135.8MB in the beginning and 119.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:08:05,360 INFO L158 Benchmark]: TraceAbstraction took 1199.08ms. Allocated memory is still 201.3MB. Free memory was 118.7MB in the beginning and 147.6MB in the end (delta: -28.9MB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. [2025-03-17 05:08:05,360 INFO L158 Benchmark]: Witness Printer took 4.65ms. Allocated memory is still 201.3MB. Free memory was 147.6MB in the beginning and 147.5MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:08:05,361 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.86ms. Allocated memory is still 201.3MB. Free memory was 152.9MB in the beginning and 140.0MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.08ms. Allocated memory is still 201.3MB. Free memory was 140.0MB in the beginning and 138.0MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.31ms. Allocated memory is still 201.3MB. Free memory was 138.0MB in the beginning and 135.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 333.92ms. Allocated memory is still 201.3MB. Free memory was 135.8MB in the beginning and 119.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1199.08ms. Allocated memory is still 201.3MB. Free memory was 118.7MB in the beginning and 147.6MB in the end (delta: -28.9MB). Peak memory consumption was 81.9MB. Max. memory is 16.1GB. * Witness Printer took 4.65ms. Allocated memory is still 201.3MB. Free memory was 147.6MB in the beginning and 147.5MB in the end (delta: 60.0kB). 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 someBinaryFLOATComparisonOperation at line 106, overapproximation of someUnaryDOUBLEoperation at line 61, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 5; [L23] unsigned long int var_1_2 = 8; [L24] double var_1_3 = 9.15; [L25] double var_1_6 = 1000000.875; [L26] double var_1_7 = 49.25; [L27] double var_1_8 = -0.8; [L28] signed char var_1_9 = -10; [L29] unsigned short int var_1_10 = 58996; [L30] unsigned short int var_1_11 = 32; [L31] signed char var_1_12 = 32; [L32] signed char var_1_13 = 16; [L33] signed char var_1_14 = 2; [L34] signed long int var_1_15 = 32; [L35] signed long int var_1_17 = 1000000000; [L36] float var_1_18 = -0.5; [L37] signed char var_1_19 = 2; [L38] unsigned char var_1_20 = 0; [L39] unsigned char var_1_21 = 0; [L40] double last_1_var_1_3 = 9.15; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] last_1_var_1_3 = var_1_3 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_ulong() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L73] CALL assume_abort_if_not(var_1_2 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L73] RET assume_abort_if_not(var_1_2 <= 4294967294) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_6=8000007/8, var_1_7=197/4, var_1_9=-10] [L74] var_1_6 = __VERIFIER_nondet_double() [L75] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_7=197/4, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_7=197/4, var_1_9=-10] [L75] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_7=197/4, var_1_9=-10] [L76] var_1_7 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L77] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L78] var_1_8 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L79] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=58996, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L80] var_1_10 = __VERIFIER_nondet_ushort() [L81] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L81] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L82] CALL assume_abort_if_not(var_1_10 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L82] RET assume_abort_if_not(var_1_10 <= 65535) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L83] var_1_11 = __VERIFIER_nondet_ushort() [L84] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L84] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L85] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L85] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=32, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L86] var_1_12 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L87] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L88] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L88] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=16, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L89] var_1_13 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L90] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L91] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L91] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L92] var_1_14 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L93] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L94] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L94] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=1000000000, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L95] var_1_17 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_17 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L96] RET assume_abort_if_not(var_1_17 >= 536870911) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L97] CALL assume_abort_if_not(var_1_17 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L97] RET assume_abort_if_not(var_1_17 <= 1073741823) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=0, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L98] var_1_21 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_21 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L99] RET assume_abort_if_not(var_1_21 >= 1) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L100] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L100] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_19=2, var_1_1=5, var_1_20=0, var_1_21=-255, var_1_2=-4294967295, var_1_3=183/20, var_1_9=-10] [L114] RET updateVariables() [L115] CALL step() [L44] var_1_1 = var_1_2 [L45] var_1_18 = var_1_8 [L46] var_1_19 = var_1_12 [L47] var_1_20 = var_1_21 [L48] signed char stepLocal_1 = var_1_19; VAL [isInitial=1, last_1_var_1_3=183/20, stepLocal_1=0, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_18=1000000005, var_1_19=0, var_1_1=-4294967295, var_1_20=-255, var_1_21=-255, var_1_2=-4294967295, var_1_3=183/20, var_1_8=1000000005, var_1_9=-10] [L49] COND TRUE (- (var_1_10 - var_1_11)) >= stepLocal_1 [L50] var_1_9 = (var_1_12 - ((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14)))) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=32, var_1_17=536870911, var_1_18=1000000005, var_1_19=0, var_1_1=-4294967295, var_1_20=-255, var_1_21=-255, var_1_2=-4294967295, var_1_3=183/20, var_1_8=1000000005, var_1_9=-1] [L54] COND TRUE \read(var_1_20) [L55] var_1_15 = (var_1_12 - var_1_14) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=536870911, var_1_18=1000000005, var_1_19=0, var_1_1=-4294967295, var_1_20=-255, var_1_21=-255, var_1_2=-4294967295, var_1_3=183/20, var_1_8=1000000005, var_1_9=-1] [L59] signed long int stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_3=183/20, stepLocal_0=0, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=536870911, var_1_18=1000000005, var_1_19=0, var_1_1=-4294967295, var_1_20=-255, var_1_21=-255, var_1_2=-4294967295, var_1_3=183/20, var_1_8=1000000005, var_1_9=-1] [L60] COND TRUE stepLocal_0 < var_1_1 [L61] var_1_3 = -0.5 VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=536870911, var_1_18=1000000005, var_1_19=0, var_1_1=-4294967295, var_1_20=-255, var_1_21=-255, var_1_2=-4294967295, var_1_8=1000000005, var_1_9=-1] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return ((((((var_1_1 == ((unsigned long int) var_1_2)) && ((var_1_15 < var_1_1) ? (var_1_3 == ((double) -0.5)) : (((- last_1_var_1_3) == (var_1_6 - var_1_7)) ? (var_1_3 == ((double) var_1_8)) : (var_1_3 == ((double) var_1_8))))) && (((- (var_1_10 - var_1_11)) >= var_1_19) ? (var_1_9 == ((signed char) (var_1_12 - ((((var_1_13) > (var_1_14)) ? (var_1_13) : (var_1_14)))))) : (var_1_9 == ((signed char) ((((var_1_12) < (var_1_14)) ? (var_1_12) : (var_1_14))))))) && (var_1_20 ? (var_1_15 == ((signed long int) (var_1_12 - var_1_14))) : (var_1_15 == ((signed long int) (var_1_13 - ((var_1_17 - 4) + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) && (var_1_18 == ((float) var_1_8))) && (var_1_19 == ((signed char) var_1_12))) && (var_1_20 == ((unsigned char) var_1_21)) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=536870911, var_1_18=1000000005, var_1_19=0, var_1_1=-4294967295, var_1_20=-255, var_1_21=-255, var_1_2=-4294967295, var_1_8=1000000005, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_3=183/20, var_1_10=32767, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_17=536870911, var_1_18=1000000005, var_1_19=0, var_1_1=-4294967295, var_1_20=-255, var_1_21=-255, var_1_2=-4294967295, var_1_8=1000000005, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 91 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 68 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 276 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1332/1368 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-17 05:08:05,381 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-10.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 276665dc6e625a61dc2ccb3f599e36b7d7e4c6f98ac725a766d4de866c89eedf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:08:07,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:08:07,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:08:07,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:08:07,496 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:08:07,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:08:07,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:08:07,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:08:07,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:08:07,522 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:08:07,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:08:07,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:08:07,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:08:07,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:08:07,523 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:08:07,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:08:07,523 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:08:07,523 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:08:07,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:08:07,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:08:07,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:08:07,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:08:07,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:08:07,524 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:08:07,524 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:08:07,524 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:08:07,524 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:08:07,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:08:07,524 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:08:07,524 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:08:07,524 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:08:07,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:08:07,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:08:07,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:08:07,525 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:08:07,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:08:07,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:08:07,525 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:08:07,525 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:08:07,525 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:08:07,525 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:08:07,525 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:08:07,525 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:08:07,525 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:08:07,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:08:07,525 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 -> 276665dc6e625a61dc2ccb3f599e36b7d7e4c6f98ac725a766d4de866c89eedf [2025-03-17 05:08:07,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:08:07,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:08:07,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:08:07,839 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:08:07,840 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:08:07,840 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-10.i [2025-03-17 05:08:09,107 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a86cacb3/039ee315707f441380eaf3c6fc6fdb50/FLAG14b1b7040 [2025-03-17 05:08:09,316 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:08:09,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-10.i [2025-03-17 05:08:09,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a86cacb3/039ee315707f441380eaf3c6fc6fdb50/FLAG14b1b7040 [2025-03-17 05:08:09,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a86cacb3/039ee315707f441380eaf3c6fc6fdb50 [2025-03-17 05:08:09,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:08:09,343 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:08:09,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:08:09,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:08:09,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:08:09,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:08:09" (1/1) ... [2025-03-17 05:08:09,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@674cd4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:09, skipping insertion in model container [2025-03-17 05:08:09,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:08:09" (1/1) ... [2025-03-17 05:08:09,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:08:09,480 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-10.i[913,926] [2025-03-17 05:08:09,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:08:09,531 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:08:09,541 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-10.i[913,926] [2025-03-17 05:08:09,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:08:09,574 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:08:09,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:09 WrapperNode [2025-03-17 05:08:09,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:08:09,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:08:09,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:08:09,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:08:09,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:09" (1/1) ... [2025-03-17 05:08:09,602 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:09" (1/1) ... [2025-03-17 05:08:09,633 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-03-17 05:08:09,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:08:09,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:08:09,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:08:09,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:08:09,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:09" (1/1) ... [2025-03-17 05:08:09,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:09" (1/1) ... [2025-03-17 05:08:09,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:09" (1/1) ... [2025-03-17 05:08:09,655 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-17 05:08:09,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:09" (1/1) ... [2025-03-17 05:08:09,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:09" (1/1) ... [2025-03-17 05:08:09,666 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:09" (1/1) ... [2025-03-17 05:08:09,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:09" (1/1) ... [2025-03-17 05:08:09,672 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:09" (1/1) ... [2025-03-17 05:08:09,673 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:09" (1/1) ... [2025-03-17 05:08:09,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:08:09,677 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:08:09,678 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:08:09,678 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:08:09,679 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:09" (1/1) ... [2025-03-17 05:08:09,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:08:09,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:08:09,703 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-17 05:08:09,706 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-17 05:08:09,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:08:09,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:08:09,725 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:08:09,726 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:08:09,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:08:09,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:08:09,785 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:08:09,786 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:08:10,388 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 05:08:10,390 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:08:10,397 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:08:10,398 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:08:10,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:08:10 BoogieIcfgContainer [2025-03-17 05:08:10,398 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:08:10,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:08:10,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:08:10,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:08:10,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:08:09" (1/3) ... [2025-03-17 05:08:10,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be29fcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:08:10, skipping insertion in model container [2025-03-17 05:08:10,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:09" (2/3) ... [2025-03-17 05:08:10,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1be29fcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:08:10, skipping insertion in model container [2025-03-17 05:08:10,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:08:10" (3/3) ... [2025-03-17 05:08:10,407 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-10.i [2025-03-17 05:08:10,419 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:08:10,421 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-10.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:08:10,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:08:10,482 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;@776d37d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:08:10,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:08:10,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:08:10,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:08:10,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:08:10,499 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:08:10,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:08:10,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:08:10,506 INFO L85 PathProgramCache]: Analyzing trace with hash 641640895, now seen corresponding path program 1 times [2025-03-17 05:08:10,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:08:10,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254747442] [2025-03-17 05:08:10,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:08:10,516 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-17 05:08:10,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:08:10,519 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-17 05:08:10,521 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-17 05:08:10,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:08:10,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:08:10,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:08:10,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:08:10,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:08:10,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:08:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 05:08:10,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:08:10,764 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:08:10,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254747442] [2025-03-17 05:08:10,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254747442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:08:10,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:08:10,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:08:10,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097702634] [2025-03-17 05:08:10,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:08:10,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:08:10,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:08:10,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:08:10,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:08:10,792 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:08:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:08:10,827 INFO L93 Difference]: Finished difference Result 93 states and 161 transitions. [2025-03-17 05:08:10,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:08:10,829 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 115 [2025-03-17 05:08:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:08:10,836 INFO L225 Difference]: With dead ends: 93 [2025-03-17 05:08:10,836 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 05:08:10,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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-17 05:08:10,845 INFO L435 NwaCegarLoop]: 68 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, 68 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-17 05:08:10,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:08:10,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 05:08:10,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 05:08:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:08:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2025-03-17 05:08:10,892 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 115 [2025-03-17 05:08:10,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:08:10,893 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2025-03-17 05:08:10,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:08:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2025-03-17 05:08:10,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 05:08:10,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:08:10,900 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 05:08:10,909 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-17 05:08:11,101 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-17 05:08:11,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:08:11,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:08:11,104 INFO L85 PathProgramCache]: Analyzing trace with hash -782496612, now seen corresponding path program 1 times [2025-03-17 05:08:11,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:08:11,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505721756] [2025-03-17 05:08:11,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:08:11,105 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-17 05:08:11,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:08:11,110 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-17 05:08:11,119 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-17 05:08:11,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 05:08:11,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 05:08:11,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:08:11,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:08:11,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 05:08:11,336 INFO L279 TraceCheckSpWp]: Computing forward predicates...