./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.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 ce316eeb4b3641499c2394eeff325d13cd059837344f9d1e23ab187d3034f448 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:18:27,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:18:27,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:18:27,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:18:27,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:18:27,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:18:27,235 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:18:27,235 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:18:27,237 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:18:27,237 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:18:27,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:18:27,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:18:27,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:18:27,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:18:27,237 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:18:27,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:18:27,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:18:27,237 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:18:27,237 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:18:27,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:18:27,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:18:27,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:18:27,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:18:27,237 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:18:27,237 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:18:27,238 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:18:27,238 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:18:27,238 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:18:27,238 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:18:27,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:18:27,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:18:27,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:18:27,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:18:27,238 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:18:27,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:18:27,238 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:18:27,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:18:27,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:18:27,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:18:27,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:18:27,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:18:27,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:18:27,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:18:27,238 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 -> ce316eeb4b3641499c2394eeff325d13cd059837344f9d1e23ab187d3034f448 [2025-03-08 14:18:27,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:18:27,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:18:27,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:18:27,475 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:18:27,475 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:18:27,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.i [2025-03-08 14:18:28,631 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099595c14/011079775abc4c69b97c686a97b7ad41/FLAG9cacfd22f [2025-03-08 14:18:28,836 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:18:28,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.i [2025-03-08 14:18:28,844 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099595c14/011079775abc4c69b97c686a97b7ad41/FLAG9cacfd22f [2025-03-08 14:18:28,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099595c14/011079775abc4c69b97c686a97b7ad41 [2025-03-08 14:18:28,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:18:28,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:18:28,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:18:28,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:18:28,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:18:28,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:18:28" (1/1) ... [2025-03-08 14:18:28,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53398619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:28, skipping insertion in model container [2025-03-08 14:18:28,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:18:28" (1/1) ... [2025-03-08 14:18:28,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:18:28,985 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_loopvsstraightlinecode_25-1loop_file-19.i[915,928] [2025-03-08 14:18:29,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:18:29,021 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:18:29,029 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_loopvsstraightlinecode_25-1loop_file-19.i[915,928] [2025-03-08 14:18:29,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:18:29,051 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:18:29,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:29 WrapperNode [2025-03-08 14:18:29,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:18:29,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:18:29,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:18:29,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:18:29,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:29" (1/1) ... [2025-03-08 14:18:29,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:29" (1/1) ... [2025-03-08 14:18:29,080 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-08 14:18:29,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:18:29,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:18:29,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:18:29,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:18:29,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:29" (1/1) ... [2025-03-08 14:18:29,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:29" (1/1) ... [2025-03-08 14:18:29,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:29" (1/1) ... [2025-03-08 14:18:29,098 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:18:29,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:29" (1/1) ... [2025-03-08 14:18:29,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:29" (1/1) ... [2025-03-08 14:18:29,102 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:29" (1/1) ... [2025-03-08 14:18:29,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:29" (1/1) ... [2025-03-08 14:18:29,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:29" (1/1) ... [2025-03-08 14:18:29,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:29" (1/1) ... [2025-03-08 14:18:29,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:18:29,107 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:18:29,107 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:18:29,107 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:18:29,108 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:29" (1/1) ... [2025-03-08 14:18:29,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:18:29,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:18:29,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:18:29,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:18:29,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:18:29,162 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:18:29,162 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:18:29,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:18:29,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:18:29,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:18:29,217 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:18:29,220 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:18:29,396 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~bitwise15#1; [2025-03-08 14:18:29,414 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 14:18:29,414 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:18:29,425 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:18:29,425 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:18:29,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:18:29 BoogieIcfgContainer [2025-03-08 14:18:29,425 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:18:29,427 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:18:29,427 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:18:29,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:18:29,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:18:28" (1/3) ... [2025-03-08 14:18:29,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643ac017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:18:29, skipping insertion in model container [2025-03-08 14:18:29,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:29" (2/3) ... [2025-03-08 14:18:29,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643ac017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:18:29, skipping insertion in model container [2025-03-08 14:18:29,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:18:29" (3/3) ... [2025-03-08 14:18:29,432 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-19.i [2025-03-08 14:18:29,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:18:29,443 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-19.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:18:29,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:18:29,492 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;@13a70dc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:18:29,492 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:18:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:18:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 14:18:29,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:18:29,501 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:18:29,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:18:29,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:18:29,504 INFO L85 PathProgramCache]: Analyzing trace with hash 988690962, now seen corresponding path program 1 times [2025-03-08 14:18:29,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:18:29,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543787732] [2025-03-08 14:18:29,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:29,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:18:29,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 14:18:29,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 14:18:29,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:29,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:18:29,708 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 14:18:29,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:18:29,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543787732] [2025-03-08 14:18:29,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543787732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:18:29,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142026558] [2025-03-08 14:18:29,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:29,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:18:29,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:18:29,715 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 14:18:29,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 14:18:29,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 14:18:29,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 14:18:29,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:29,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:18:29,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:18:29,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:18:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 14:18:29,846 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:18:29,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142026558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:18:29,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:18:29,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:18:29,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334256666] [2025-03-08 14:18:29,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:18:29,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:18:29,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:18:29,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:18:29,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:18:29,868 INFO L87 Difference]: Start difference. First operand has 58 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 39 states have internal predecessors, (50), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:18:29,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:18:29,887 INFO L93 Difference]: Finished difference Result 113 states and 182 transitions. [2025-03-08 14:18:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:18:29,888 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2025-03-08 14:18:29,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:18:29,892 INFO L225 Difference]: With dead ends: 113 [2025-03-08 14:18:29,892 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 14:18:29,894 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-08 14:18:29,895 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:18:29,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:18:29,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 14:18:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-08 14:18:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:18:29,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2025-03-08 14:18:29,923 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 79 transitions. Word has length 113 [2025-03-08 14:18:29,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:18:29,923 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 79 transitions. [2025-03-08 14:18:29,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:18:29,923 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 79 transitions. [2025-03-08 14:18:29,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 14:18:29,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:18:29,925 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:18:29,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 14:18:30,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 14:18:30,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:18:30,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:18:30,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1295430261, now seen corresponding path program 1 times [2025-03-08 14:18:30,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:18:30,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560105473] [2025-03-08 14:18:30,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:30,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:18:30,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 14:18:30,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 14:18:30,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:30,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:18:30,230 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:18:30,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 14:18:30,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 14:18:30,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:30,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:18:30,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:18:30,362 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:18:30,363 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:18:30,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 14:18:30,366 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-08 14:18:30,431 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:18:30,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:18:30 BoogieIcfgContainer [2025-03-08 14:18:30,435 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:18:30,436 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:18:30,436 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:18:30,436 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:18:30,437 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:18:29" (3/4) ... [2025-03-08 14:18:30,438 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:18:30,439 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:18:30,440 INFO L158 Benchmark]: Toolchain (without parser) took 1582.02ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 101.7MB in the end (delta: 19.3MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2025-03-08 14:18:30,440 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:18:30,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.83ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 108.1MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:18:30,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.67ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 106.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:18:30,443 INFO L158 Benchmark]: Boogie Preprocessor took 25.43ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 104.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:18:30,444 INFO L158 Benchmark]: IcfgBuilder took 318.52ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 85.8MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:18:30,444 INFO L158 Benchmark]: TraceAbstraction took 1008.69ms. Allocated memory is still 167.8MB. Free memory was 85.4MB in the beginning and 102.6MB in the end (delta: -17.2MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. [2025-03-08 14:18:30,444 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 101.7MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:18:30,445 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.21ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.83ms. Allocated memory is still 167.8MB. Free memory was 120.9MB in the beginning and 108.1MB in the end (delta: 12.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.67ms. Allocated memory is still 167.8MB. Free memory was 108.1MB in the beginning and 106.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.43ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 104.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 318.52ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 85.8MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1008.69ms. Allocated memory is still 167.8MB. Free memory was 85.4MB in the beginning and 102.6MB in the end (delta: -17.2MB). Peak memory consumption was 64.3MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 101.7MB in the end (delta: 50.8kB). 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 89, overapproximation of someBinaryFLOATComparisonOperation at line 87, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryArithmeticFLOAToperation at line 50. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 8; [L23] unsigned char var_1_2 = 128; [L24] unsigned char var_1_3 = 64; [L25] unsigned long int var_1_4 = 1; [L26] unsigned long int var_1_5 = 5; [L27] signed char var_1_7 = 4; [L28] signed char var_1_8 = 100; [L29] unsigned char var_1_9 = 1; [L30] signed long int var_1_10 = -8; [L31] float var_1_11 = 255.2; [L32] float var_1_12 = 128.25; [L33] float var_1_13 = 100.5; [L34] float var_1_14 = 255.9; [L35] signed long int var_1_15 = -128; [L36] unsigned short int var_1_16 = 2; [L37] signed long int last_1_var_1_10 = -8; VAL [isInitial=0, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=128, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L101] isInitial = 1 [L102] FCALL initially() [L103] int k_loop; [L104] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=128, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L104] COND TRUE k_loop < 1 [L105] CALL updateLastVariables() [L94] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=128, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L66] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L67] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L67] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=64, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L68] var_1_3 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L69] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L70] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=1, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L71] var_1_4 = __VERIFIER_nondet_ulong() [L72] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L72] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_4 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L73] RET assume_abort_if_not(var_1_4 <= 12) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=5, var_1_7=4, var_1_8=100, var_1_9=1] [L74] var_1_5 = __VERIFIER_nondet_ulong() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_7=4, var_1_8=100, var_1_9=1] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_7=4, var_1_8=100, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_5 <= 11) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=4, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=4, var_1_8=100, var_1_9=1] [L76] RET assume_abort_if_not(var_1_5 <= 11) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=4, var_1_8=100, var_1_9=1] [L77] var_1_7 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_7 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=100, var_1_9=1] [L78] RET assume_abort_if_not(var_1_7 >= -63) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=100, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=100, var_1_9=1] [L79] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=100, var_1_9=1] [L80] var_1_8 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L81] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L82] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L82] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L83] var_1_9 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1] [L84] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1] [L85] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L85] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_12=513/4, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L86] var_1_12 = __VERIFIER_nondet_float() [L87] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L87] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_13=201/2, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L88] var_1_13 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L89] RET assume_abort_if_not((var_1_13 >= -230584.3009213691390e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 2305843.009213691390e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_14=2559/10, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L90] var_1_14 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L91] RET assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L106] RET updateVariables() [L107] CALL step() [L41] COND TRUE var_1_7 < var_1_3 VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=-8, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L42] COND TRUE last_1_var_1_10 > var_1_7 [L43] var_1_10 = (var_1_3 - var_1_8) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=126, var_1_11=1276/5, var_1_15=-128, var_1_16=2, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L50] var_1_11 = (var_1_12 + (var_1_13 + var_1_14)) [L51] var_1_16 = 64 VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=126, var_1_15=-128, var_1_16=64, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L52] COND TRUE \read(var_1_9) [L53] var_1_15 = (var_1_7 + var_1_16) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=126, var_1_15=1, var_1_16=64, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L55] signed long int stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_10=-8, stepLocal_0=1, var_1_10=126, var_1_15=1, var_1_16=64, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L56] EXPR (var_1_2 - var_1_3) << (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_10=-8, stepLocal_0=1, var_1_10=126, var_1_15=1, var_1_16=64, var_1_1=8, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L56] COND TRUE ((var_1_2 - var_1_3) << (var_1_4 + var_1_5)) <= stepLocal_0 [L57] var_1_1 = ((((var_1_4) > (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) ? (var_1_4) : (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))))) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=126, var_1_15=1, var_1_16=64, var_1_1=5, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L107] RET step() [L108] CALL, EXPR property() [L97] EXPR (var_1_2 - var_1_3) << (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=126, var_1_15=1, var_1_16=64, var_1_1=5, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L97-L98] return (((((((var_1_2 - var_1_3) << (var_1_4 + var_1_5)) <= var_1_15) ? (var_1_1 == ((signed char) ((((var_1_4) > (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) ? (var_1_4) : (((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))))))) : (var_1_9 ? (var_1_1 == ((signed char) var_1_5)) : 1)) && ((var_1_7 < var_1_3) ? ((last_1_var_1_10 > var_1_7) ? (var_1_10 == ((signed long int) (var_1_3 - var_1_8))) : 1) : (var_1_9 ? (var_1_10 == ((signed long int) var_1_5)) : 1))) && (var_1_11 == ((float) (var_1_12 + (var_1_13 + var_1_14))))) && (var_1_9 ? (var_1_15 == ((signed long int) (var_1_7 + var_1_16))) : 1)) && (var_1_16 == ((unsigned short int) 64)) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=126, var_1_15=1, var_1_16=64, var_1_1=5, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-8, var_1_10=126, var_1_15=1, var_1_16=64, var_1_1=5, var_1_2=127, var_1_3=127, var_1_4=-4294967291, var_1_5=4, var_1_7=-63, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 101 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 17, 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, 80 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 80 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred 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.1s InterpolantComputationTime, 339 NumberOfCodeBlocks, 339 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 262 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1056/1088 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 14:18:30,462 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_loopvsstraightlinecode_25-1loop_file-19.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 ce316eeb4b3641499c2394eeff325d13cd059837344f9d1e23ab187d3034f448 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:18:32,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:18:32,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:18:32,323 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:18:32,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:18:32,338 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:18:32,339 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:18:32,339 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:18:32,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:18:32,339 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:18:32,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:18:32,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:18:32,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:18:32,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:18:32,340 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:18:32,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:18:32,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:18:32,340 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:18:32,340 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:18:32,340 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:18:32,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:18:32,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:18:32,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:18:32,340 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:18:32,341 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:18:32,341 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:18:32,341 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:18:32,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:18:32,341 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:18:32,341 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:18:32,341 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:18:32,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:18:32,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:18:32,341 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:18:32,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:18:32,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:18:32,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:18:32,342 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:18:32,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:18:32,342 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:18:32,342 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:18:32,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:18:32,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:18:32,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:18:32,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:18:32,343 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 -> ce316eeb4b3641499c2394eeff325d13cd059837344f9d1e23ab187d3034f448 [2025-03-08 14:18:32,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:18:32,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:18:32,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:18:32,588 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:18:32,589 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:18:32,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.i [2025-03-08 14:18:33,754 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e3ddf191/08edf3f2433944968036e375e42d3f90/FLAG6bb916572 [2025-03-08 14:18:33,941 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:18:33,942 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-19.i [2025-03-08 14:18:33,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e3ddf191/08edf3f2433944968036e375e42d3f90/FLAG6bb916572 [2025-03-08 14:18:34,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e3ddf191/08edf3f2433944968036e375e42d3f90 [2025-03-08 14:18:34,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:18:34,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:18:34,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:18:34,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:18:34,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:18:34,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:18:34" (1/1) ... [2025-03-08 14:18:34,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b505b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:34, skipping insertion in model container [2025-03-08 14:18:34,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:18:34" (1/1) ... [2025-03-08 14:18:34,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:18:34,410 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_loopvsstraightlinecode_25-1loop_file-19.i[915,928] [2025-03-08 14:18:34,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:18:34,450 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:18:34,457 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_loopvsstraightlinecode_25-1loop_file-19.i[915,928] [2025-03-08 14:18:34,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:18:34,484 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:18:34,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:34 WrapperNode [2025-03-08 14:18:34,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:18:34,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:18:34,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:18:34,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:18:34,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:34" (1/1) ... [2025-03-08 14:18:34,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:34" (1/1) ... [2025-03-08 14:18:34,521 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2025-03-08 14:18:34,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:18:34,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:18:34,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:18:34,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:18:34,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:34" (1/1) ... [2025-03-08 14:18:34,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:34" (1/1) ... [2025-03-08 14:18:34,537 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:34" (1/1) ... [2025-03-08 14:18:34,553 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 14:18:34,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:34" (1/1) ... [2025-03-08 14:18:34,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:34" (1/1) ... [2025-03-08 14:18:34,558 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:34" (1/1) ... [2025-03-08 14:18:34,559 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:34" (1/1) ... [2025-03-08 14:18:34,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:34" (1/1) ... [2025-03-08 14:18:34,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:34" (1/1) ... [2025-03-08 14:18:34,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:18:34,562 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:18:34,562 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:18:34,562 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:18:34,563 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:34" (1/1) ... [2025-03-08 14:18:34,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:18:34,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:18:34,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 14:18:34,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 14:18:34,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:18:34,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:18:34,614 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:18:34,614 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:18:34,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:18:34,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:18:34,664 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:18:34,665 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:18:35,264 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-08 14:18:35,264 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:18:35,271 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:18:35,271 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:18:35,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:18:35 BoogieIcfgContainer [2025-03-08 14:18:35,271 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:18:35,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:18:35,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:18:35,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:18:35,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:18:34" (1/3) ... [2025-03-08 14:18:35,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c1a9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:18:35, skipping insertion in model container [2025-03-08 14:18:35,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:18:34" (2/3) ... [2025-03-08 14:18:35,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43c1a9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:18:35, skipping insertion in model container [2025-03-08 14:18:35,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:18:35" (3/3) ... [2025-03-08 14:18:35,282 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-19.i [2025-03-08 14:18:35,291 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:18:35,292 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-19.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:18:35,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:18:35,340 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;@3aa2d2cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:18:35,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:18:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:18:35,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 14:18:35,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:18:35,351 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:18:35,352 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:18:35,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:18:35,355 INFO L85 PathProgramCache]: Analyzing trace with hash -220634827, now seen corresponding path program 1 times [2025-03-08 14:18:35,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:18:35,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831167538] [2025-03-08 14:18:35,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:35,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:18:35,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:18:35,365 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:18:35,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 14:18:35,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 14:18:35,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 14:18:35,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:35,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:18:35,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:18:35,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:18:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-08 14:18:35,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:18:35,616 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:18:35,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831167538] [2025-03-08 14:18:35,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831167538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:18:35,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:18:35,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:18:35,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154674084] [2025-03-08 14:18:35,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:18:35,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:18:35,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:18:35,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:18:35,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:18:35,635 INFO L87 Difference]: Start difference. First operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:18:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:18:35,648 INFO L93 Difference]: Finished difference Result 103 states and 168 transitions. [2025-03-08 14:18:35,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:18:35,650 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110 [2025-03-08 14:18:35,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:18:35,654 INFO L225 Difference]: With dead ends: 103 [2025-03-08 14:18:35,654 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 14:18:35,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:18:35,658 INFO L435 NwaCegarLoop]: 75 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, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 14:18:35,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:18:35,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 14:18:35,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 14:18:35,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 14:18:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-03-08 14:18:35,687 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 110 [2025-03-08 14:18:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:18:35,687 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-03-08 14:18:35,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 14:18:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-03-08 14:18:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 14:18:35,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:18:35,691 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 14:18:35,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 14:18:35,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:18:35,892 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:18:35,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:18:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash -983860302, now seen corresponding path program 1 times [2025-03-08 14:18:35,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:18:35,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322499395] [2025-03-08 14:18:35,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:18:35,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 14:18:35,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:18:35,895 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 14:18:35,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 14:18:35,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 14:18:36,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 14:18:36,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:18:36,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:18:36,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 14:18:36,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:18:55,124 WARN L286 SmtUtils]: Spent 5.45s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 14:19:14,013 WARN L286 SmtUtils]: Spent 7.61s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 14:19:34,426 WARN L286 SmtUtils]: Spent 7.48s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 14:20:02,827 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 102 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)