./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.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 78bf3ce40ded3ae0bef00a22026555953d3817587ab73904ce26421056be8ea6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:31:44,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:31:44,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:31:44,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:31:44,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:31:44,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:31:44,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:31:44,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:31:44,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:31:44,338 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:31:44,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:31:44,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:31:44,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:31:44,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:31:44,340 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:31:44,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:31:44,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:31:44,340 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:31:44,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:31:44,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:31:44,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:31:44,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:31:44,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:31:44,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:31:44,341 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:31:44,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:31:44,341 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:31:44,341 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:31:44,341 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:31:44,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:31:44,341 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:31:44,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:31:44,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:31:44,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:31:44,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:31:44,342 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:31:44,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:31:44,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:31:44,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:31:44,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:31:44,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:31:44,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:31:44,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:31:44,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 -> 78bf3ce40ded3ae0bef00a22026555953d3817587ab73904ce26421056be8ea6 [2025-03-03 23:31:44,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:31:44,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:31:44,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:31:44,550 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:31:44,550 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:31:44,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.i [2025-03-03 23:31:45,634 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/249ef3c74/c3fa9e67f5614600b4ece41a359ab01e/FLAGb29506476 [2025-03-03 23:31:45,844 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:31:45,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.i [2025-03-03 23:31:45,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/249ef3c74/c3fa9e67f5614600b4ece41a359ab01e/FLAGb29506476 [2025-03-03 23:31:46,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/249ef3c74/c3fa9e67f5614600b4ece41a359ab01e [2025-03-03 23:31:46,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:31:46,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:31:46,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:31:46,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:31:46,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:31:46,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:31:46" (1/1) ... [2025-03-03 23:31:46,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18e5863a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:46, skipping insertion in model container [2025-03-03 23:31:46,198 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:31:46" (1/1) ... [2025-03-03 23:31:46,209 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:31:46,294 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_50-1loop_file-39.i[915,928] [2025-03-03 23:31:46,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:31:46,339 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:31:46,346 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_50-1loop_file-39.i[915,928] [2025-03-03 23:31:46,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:31:46,377 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:31:46,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:46 WrapperNode [2025-03-03 23:31:46,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:31:46,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:31:46,378 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:31:46,378 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:31:46,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:46" (1/1) ... [2025-03-03 23:31:46,391 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:46" (1/1) ... [2025-03-03 23:31:46,414 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2025-03-03 23:31:46,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:31:46,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:31:46,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:31:46,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:31:46,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:46" (1/1) ... [2025-03-03 23:31:46,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:46" (1/1) ... [2025-03-03 23:31:46,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:46" (1/1) ... [2025-03-03 23:31:46,440 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:31:46,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:46" (1/1) ... [2025-03-03 23:31:46,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:46" (1/1) ... [2025-03-03 23:31:46,445 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:46" (1/1) ... [2025-03-03 23:31:46,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:46" (1/1) ... [2025-03-03 23:31:46,446 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:46" (1/1) ... [2025-03-03 23:31:46,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:46" (1/1) ... [2025-03-03 23:31:46,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:31:46,449 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:31:46,449 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:31:46,449 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:31:46,450 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:46" (1/1) ... [2025-03-03 23:31:46,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:31:46,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:31:46,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:31:46,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:31:46,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:31:46,492 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:31:46,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:31:46,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:31:46,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:31:46,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:31:46,549 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:31:46,550 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:31:46,759 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc property_#t~bitwise15#1; [2025-03-03 23:31:46,781 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-03 23:31:46,781 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:31:46,796 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:31:46,796 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:31:46,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:31:46 BoogieIcfgContainer [2025-03-03 23:31:46,797 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:31:46,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:31:46,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:31:46,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:31:46,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:31:46" (1/3) ... [2025-03-03 23:31:46,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e851d57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:31:46, skipping insertion in model container [2025-03-03 23:31:46,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:46" (2/3) ... [2025-03-03 23:31:46,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e851d57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:31:46, skipping insertion in model container [2025-03-03 23:31:46,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:31:46" (3/3) ... [2025-03-03 23:31:46,804 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-39.i [2025-03-03 23:31:46,815 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:31:46,816 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-39.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:31:46,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:31:46,859 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;@4e8fe772, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:31:46,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:31:46,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:31:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 23:31:46,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:31:46,871 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:31:46,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:31:46,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:31:46,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1378637495, now seen corresponding path program 1 times [2025-03-03 23:31:46,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:31:46,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872865282] [2025-03-03 23:31:46,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:31:46,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:31:46,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 23:31:46,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 23:31:46,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:31:46,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:31:47,087 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-03 23:31:47,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:31:47,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872865282] [2025-03-03 23:31:47,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872865282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:31:47,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129934355] [2025-03-03 23:31:47,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:31:47,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:31:47,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:31:47,094 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:31:47,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:31:47,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 23:31:47,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 23:31:47,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:31:47,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:31:47,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:31:47,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:31:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-03 23:31:47,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:31:47,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129934355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:31:47,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:31:47,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:31:47,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601755743] [2025-03-03 23:31:47,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:31:47,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:31:47,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:31:47,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:31:47,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:31:47,261 INFO L87 Difference]: Start difference. First operand has 66 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 48 states have internal predecessors, (66), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:31:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:31:47,285 INFO L93 Difference]: Finished difference Result 129 states and 209 transitions. [2025-03-03 23:31:47,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:31:47,288 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 111 [2025-03-03 23:31:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:31:47,293 INFO L225 Difference]: With dead ends: 129 [2025-03-03 23:31:47,293 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 23:31:47,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:31:47,297 INFO L435 NwaCegarLoop]: 94 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, 94 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-03 23:31:47,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:31:47,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 23:31:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-03 23:31:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:31:47,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 93 transitions. [2025-03-03 23:31:47,321 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 93 transitions. Word has length 111 [2025-03-03 23:31:47,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:31:47,321 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 93 transitions. [2025-03-03 23:31:47,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:31:47,322 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 93 transitions. [2025-03-03 23:31:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 23:31:47,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:31:47,324 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:31:47,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:31:47,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:31:47,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:31:47,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:31:47,525 INFO L85 PathProgramCache]: Analyzing trace with hash 129337147, now seen corresponding path program 1 times [2025-03-03 23:31:47,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:31:47,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293794626] [2025-03-03 23:31:47,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:31:47,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:31:47,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 23:31:47,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 23:31:47,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:31:47,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:31:47,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:31:47,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 23:31:48,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 23:31:48,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:31:48,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:31:48,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:31:48,112 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:31:48,113 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:31:48,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:31:48,116 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 23:31:48,181 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:31:48,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:31:48 BoogieIcfgContainer [2025-03-03 23:31:48,183 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:31:48,186 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:31:48,186 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:31:48,186 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:31:48,186 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:31:46" (3/4) ... [2025-03-03 23:31:48,188 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:31:48,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:31:48,189 INFO L158 Benchmark]: Toolchain (without parser) took 1995.97ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 78.7MB in the end (delta: 53.8MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2025-03-03 23:31:48,190 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:31:48,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.00ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 118.0MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:31:48,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.27ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 115.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:31:48,192 INFO L158 Benchmark]: Boogie Preprocessor took 33.23ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 112.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:31:48,192 INFO L158 Benchmark]: IcfgBuilder took 348.15ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 91.2MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 23:31:48,192 INFO L158 Benchmark]: TraceAbstraction took 1384.78ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 78.7MB in the end (delta: 11.7MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2025-03-03 23:31:48,192 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 167.8MB. Free memory was 78.7MB in the beginning and 78.7MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:31:48,193 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.00ms. Allocated memory is still 167.8MB. Free memory was 132.0MB in the beginning and 118.0MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.27ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 115.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.23ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 112.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 348.15ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 91.2MB in the end (delta: 21.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1384.78ms. Allocated memory is still 167.8MB. Free memory was 90.4MB in the beginning and 78.7MB in the end (delta: 11.7MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 167.8MB. Free memory was 78.7MB in the beginning and 78.7MB in the end (delta: 41.6kB). 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 108, overapproximation of someBinaryFLOATComparisonOperation at line 112, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryArithmeticFLOAToperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -1; [L23] unsigned char var_1_6 = 0; [L24] signed short int var_1_7 = 8; [L25] signed short int var_1_8 = 4; [L26] unsigned long int var_1_9 = 256; [L27] unsigned long int var_1_10 = 10; [L28] unsigned long int var_1_11 = 3084274888; [L29] unsigned long int var_1_13 = 50; [L30] signed long int var_1_14 = -10; [L31] unsigned char var_1_16 = 0; [L32] float var_1_19 = 4.5; [L33] float var_1_20 = 15.375; [L34] float var_1_21 = 32.725; [L35] float var_1_22 = 63.5; [L36] float var_1_23 = 16.375; [L37] signed char var_1_24 = -32; [L38] signed char var_1_25 = 0; [L39] unsigned short int var_1_26 = 64; [L40] unsigned long int last_1_var_1_9 = 256; [L41] unsigned long int last_1_var_1_10 = 10; [L42] signed long int last_1_var_1_14 = -10; [L43] signed char last_1_var_1_24 = -32; VAL [isInitial=0, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=0, var_1_7=8, var_1_8=4, var_1_9=256] [L130] isInitial = 1 [L131] FCALL initially() [L132] int k_loop; [L133] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=0, var_1_7=8, var_1_8=4, var_1_9=256] [L133] COND TRUE k_loop < 1 [L134] CALL updateLastVariables() [L120] last_1_var_1_9 = var_1_9 [L121] last_1_var_1_10 = var_1_10 [L122] last_1_var_1_14 = var_1_14 [L123] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=0, var_1_7=8, var_1_8=4, var_1_9=256] [L134] RET updateLastVariables() [L135] CALL updateVariables() [L92] var_1_6 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_7=8, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_7=8, var_1_8=4, var_1_9=256] [L93] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_7=8, var_1_8=4, var_1_9=256] [L94] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=8, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=8, var_1_8=4, var_1_9=256] [L94] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=8, var_1_8=4, var_1_9=256] [L95] var_1_7 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L96] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L97] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L97] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L98] var_1_8 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L99] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L100] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L100] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L101] var_1_11 = __VERIFIER_nondet_ulong() [L102] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L102] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L103] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L103] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L104] var_1_16 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L105] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L106] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L106] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L107] var_1_20 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L108] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L109] var_1_21 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L110] RET assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L111] var_1_22 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L112] RET assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L113] var_1_23 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L114] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L115] var_1_25 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_25 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-127, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-127, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L116] RET assume_abort_if_not(var_1_25 >= -127) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-127, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L117] CALL assume_abort_if_not(var_1_25 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-127, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-127, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L117] RET assume_abort_if_not(var_1_25 <= 126) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-127, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L135] RET updateVariables() [L136] CALL step() [L47] EXPR (last_1_var_1_10 + last_1_var_1_14) ^ last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-127, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L47] unsigned long int stepLocal_0 = (last_1_var_1_10 + last_1_var_1_14) ^ last_1_var_1_10; [L48] COND TRUE stepLocal_0 < (last_1_var_1_24 | -4) [L49] var_1_1 = (var_1_7 - var_1_8) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=256, var_1_24=-32, var_1_25=-127, var_1_26=64, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L53] var_1_24 = var_1_25 [L54] var_1_26 = var_1_8 [L55] var_1_10 = ((((((((var_1_11 - var_1_8) < 0 ) ? -(var_1_11 - var_1_8) : (var_1_11 - var_1_8)))) < (((((0u) > (var_1_26)) ? (0u) : (var_1_26))))) ? (((((var_1_11 - var_1_8) < 0 ) ? -(var_1_11 - var_1_8) : (var_1_11 - var_1_8)))) : (((((0u) > (var_1_26)) ? (0u) : (var_1_26)))))) [L56] unsigned long int stepLocal_3 = var_1_8 / (1u + 16u); [L57] unsigned long int stepLocal_2 = var_1_11; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, stepLocal_3=0, var_1_10=4, var_1_11=2147483647, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=256, var_1_24=-127, var_1_25=-127, var_1_26=4, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L58] COND FALSE !(var_1_26 < stepLocal_3) [L65] var_1_13 = var_1_8 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, var_1_10=4, var_1_11=2147483647, var_1_13=4, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=256, var_1_24=-127, var_1_25=-127, var_1_26=4, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L67] signed short int stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, stepLocal_4=4, var_1_10=4, var_1_11=2147483647, var_1_13=4, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=256, var_1_24=-127, var_1_25=-127, var_1_26=4, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L68] COND TRUE stepLocal_4 <= var_1_13 [L69] var_1_19 = (((((((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) + var_1_22)) > (var_1_23)) ? ((((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) + var_1_22)) : (var_1_23))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, var_1_10=4, var_1_11=2147483647, var_1_13=4, var_1_14=-10, var_1_16=1, var_1_19=3084274893, var_1_1=256, var_1_23=3084274893, var_1_24=-127, var_1_25=-127, var_1_26=4, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L73] unsigned long int stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_1=4, stepLocal_2=2147483647, var_1_10=4, var_1_11=2147483647, var_1_13=4, var_1_14=-10, var_1_16=1, var_1_19=3084274893, var_1_1=256, var_1_23=3084274893, var_1_24=-127, var_1_25=-127, var_1_26=4, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L74] COND FALSE !(stepLocal_1 >= ((((var_1_1) < (last_1_var_1_9)) ? (var_1_1) : (last_1_var_1_9)))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, var_1_10=4, var_1_11=2147483647, var_1_13=4, var_1_14=-10, var_1_16=1, var_1_19=3084274893, var_1_1=256, var_1_23=3084274893, var_1_24=-127, var_1_25=-127, var_1_26=4, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L79] COND FALSE !(var_1_26 >= var_1_7) [L88] var_1_14 = var_1_24 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=2147483647, var_1_10=4, var_1_11=2147483647, var_1_13=4, var_1_14=-127, var_1_16=1, var_1_19=3084274893, var_1_1=256, var_1_23=3084274893, var_1_24=-127, var_1_25=-127, var_1_26=4, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L136] RET step() [L137] CALL, EXPR property() [L126] EXPR (last_1_var_1_10 + last_1_var_1_14) ^ last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=4, var_1_11=2147483647, var_1_13=4, var_1_14=-127, var_1_16=1, var_1_19=3084274893, var_1_1=256, var_1_23=3084274893, var_1_24=-127, var_1_25=-127, var_1_26=4, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L126-L127] return ((((((((((last_1_var_1_10 + last_1_var_1_14) ^ last_1_var_1_10) < (last_1_var_1_24 | -4)) ? (var_1_1 == ((signed short int) (var_1_7 - var_1_8))) : (var_1_1 == ((signed short int) (last_1_var_1_10 + -16)))) && ((var_1_10 >= ((((var_1_1) < (last_1_var_1_9)) ? (var_1_1) : (last_1_var_1_9)))) ? (var_1_6 ? (var_1_9 == ((unsigned long int) var_1_8)) : 1) : 1)) && (var_1_10 == ((unsigned long int) ((((((((var_1_11 - var_1_8) < 0 ) ? -(var_1_11 - var_1_8) : (var_1_11 - var_1_8)))) < (((((0u) > (var_1_26)) ? (0u) : (var_1_26))))) ? (((((var_1_11 - var_1_8) < 0 ) ? -(var_1_11 - var_1_8) : (var_1_11 - var_1_8)))) : (((((0u) > (var_1_26)) ? (0u) : (var_1_26))))))))) && ((var_1_26 < (var_1_8 / (1u + 16u))) ? ((var_1_11 > (var_1_26 + 5u)) ? (var_1_13 == ((unsigned long int) ((((var_1_26) > (var_1_11)) ? (var_1_26) : (var_1_11))))) : (var_1_13 == ((unsigned long int) 5u))) : (var_1_13 == ((unsigned long int) var_1_8)))) && ((var_1_26 >= var_1_7) ? ((var_1_1 > var_1_11) ? ((var_1_6 && var_1_16) ? (var_1_14 == ((signed long int) (var_1_7 - (var_1_26 + var_1_8)))) : (var_1_14 == ((signed long int) var_1_26))) : 1) : (var_1_14 == ((signed long int) var_1_24)))) && ((var_1_8 <= var_1_13) ? (var_1_19 == ((float) (((((((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) + var_1_22)) > (var_1_23)) ? ((((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) + var_1_22)) : (var_1_23))))) : (var_1_19 == ((float) var_1_22)))) && (var_1_24 == ((signed char) var_1_25))) && (var_1_26 == ((unsigned short int) var_1_8)) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=4, var_1_11=2147483647, var_1_13=4, var_1_14=-127, var_1_16=1, var_1_19=3084274893, var_1_1=256, var_1_23=3084274893, var_1_24=-127, var_1_25=-127, var_1_26=4, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=4, var_1_11=2147483647, var_1_13=4, var_1_14=-127, var_1_16=1, var_1_19=3084274893, var_1_1=256, var_1_23=3084274893, var_1_24=-127, var_1_25=-127, var_1_26=4, var_1_6=1, var_1_7=260, var_1_8=4, var_1_9=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 94 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, 94 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 333 NumberOfCodeBlocks, 333 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 930/960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:31:48,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.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 78bf3ce40ded3ae0bef00a22026555953d3817587ab73904ce26421056be8ea6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:31:49,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:31:50,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:31:50,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:31:50,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:31:50,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:31:50,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:31:50,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:31:50,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:31:50,098 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:31:50,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:31:50,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:31:50,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:31:50,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:31:50,100 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:31:50,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:31:50,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:31:50,100 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:31:50,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:31:50,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:31:50,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:31:50,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:31:50,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:31:50,101 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:31:50,101 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:31:50,101 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:31:50,101 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:31:50,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:31:50,101 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:31:50,101 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:31:50,102 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:31:50,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:31:50,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:31:50,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:31:50,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:31:50,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:31:50,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:31:50,102 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:31:50,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:31:50,103 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:31:50,103 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:31:50,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:31:50,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:31:50,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:31:50,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:31:50,103 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 -> 78bf3ce40ded3ae0bef00a22026555953d3817587ab73904ce26421056be8ea6 [2025-03-03 23:31:50,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:31:50,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:31:50,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:31:50,335 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:31:50,336 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:31:50,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.i [2025-03-03 23:31:51,514 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f3a41d8d/d864adf3f93b4ac4a3e7388274d914d3/FLAGcf200f60b [2025-03-03 23:31:51,702 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:31:51,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-39.i [2025-03-03 23:31:51,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f3a41d8d/d864adf3f93b4ac4a3e7388274d914d3/FLAGcf200f60b [2025-03-03 23:31:51,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f3a41d8d/d864adf3f93b4ac4a3e7388274d914d3 [2025-03-03 23:31:51,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:31:51,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:31:51,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:31:51,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:31:51,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:31:51,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:31:51" (1/1) ... [2025-03-03 23:31:51,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f71e1ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:51, skipping insertion in model container [2025-03-03 23:31:51,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:31:51" (1/1) ... [2025-03-03 23:31:51,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:31:51,852 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_50-1loop_file-39.i[915,928] [2025-03-03 23:31:51,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:31:51,919 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:31:51,927 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_50-1loop_file-39.i[915,928] [2025-03-03 23:31:51,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:31:51,961 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:31:51,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:51 WrapperNode [2025-03-03 23:31:51,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:31:51,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:31:51,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:31:51,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:31:51,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:51" (1/1) ... [2025-03-03 23:31:51,975 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:51" (1/1) ... [2025-03-03 23:31:51,998 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-03-03 23:31:51,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:31:52,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:31:52,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:31:52,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:31:52,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:51" (1/1) ... [2025-03-03 23:31:52,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:51" (1/1) ... [2025-03-03 23:31:52,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:51" (1/1) ... [2025-03-03 23:31:52,028 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:31:52,028 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:51" (1/1) ... [2025-03-03 23:31:52,028 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:51" (1/1) ... [2025-03-03 23:31:52,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:51" (1/1) ... [2025-03-03 23:31:52,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:51" (1/1) ... [2025-03-03 23:31:52,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:51" (1/1) ... [2025-03-03 23:31:52,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:51" (1/1) ... [2025-03-03 23:31:52,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:31:52,046 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:31:52,046 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:31:52,046 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:31:52,047 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:51" (1/1) ... [2025-03-03 23:31:52,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:31:52,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:31:52,073 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:31:52,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:31:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:31:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:31:52,092 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:31:52,092 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:31:52,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:31:52,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:31:52,147 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:31:52,148 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:31:52,496 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-03 23:31:52,496 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:31:52,505 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:31:52,505 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:31:52,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:31:52 BoogieIcfgContainer [2025-03-03 23:31:52,507 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:31:52,509 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:31:52,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:31:52,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:31:52,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:31:51" (1/3) ... [2025-03-03 23:31:52,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3900a26d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:31:52, skipping insertion in model container [2025-03-03 23:31:52,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:31:51" (2/3) ... [2025-03-03 23:31:52,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3900a26d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:31:52, skipping insertion in model container [2025-03-03 23:31:52,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:31:52" (3/3) ... [2025-03-03 23:31:52,532 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-39.i [2025-03-03 23:31:52,542 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:31:52,543 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-39.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:31:52,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:31:52,596 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;@d8b42ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:31:52,596 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:31:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:31:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 23:31:52,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:31:52,607 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:31:52,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:31:52,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:31:52,611 INFO L85 PathProgramCache]: Analyzing trace with hash 70274413, now seen corresponding path program 1 times [2025-03-03 23:31:52,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:31:52,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672100527] [2025-03-03 23:31:52,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:31:52,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:31:52,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:31:52,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:31:52,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 23:31:52,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 23:31:52,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 23:31:52,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:31:52,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:31:52,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:31:52,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:31:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-03 23:31:52,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:31:52,836 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:31:52,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672100527] [2025-03-03 23:31:52,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672100527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:31:52,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:31:52,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:31:52,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167854496] [2025-03-03 23:31:52,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:31:52,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:31:52,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:31:52,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:31:52,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:31:52,857 INFO L87 Difference]: Start difference. First operand has 56 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:31:52,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:31:52,875 INFO L93 Difference]: Finished difference Result 109 states and 177 transitions. [2025-03-03 23:31:52,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:31:52,876 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2025-03-03 23:31:52,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:31:52,880 INFO L225 Difference]: With dead ends: 109 [2025-03-03 23:31:52,880 INFO L226 Difference]: Without dead ends: 53 [2025-03-03 23:31:52,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:31:52,884 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:31:52,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:31:52,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-03 23:31:52,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-03 23:31:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 23:31:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2025-03-03 23:31:52,916 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 107 [2025-03-03 23:31:52,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:31:52,916 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2025-03-03 23:31:52,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 23:31:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2025-03-03 23:31:52,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 23:31:52,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:31:52,919 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:31:52,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 23:31:53,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:31:53,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:31:53,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:31:53,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1278320655, now seen corresponding path program 1 times [2025-03-03 23:31:53,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:31:53,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57273549] [2025-03-03 23:31:53,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:31:53,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:31:53,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:31:53,125 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:31:53,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 23:31:53,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 23:31:53,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 23:31:53,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:31:53,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:31:53,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 23:31:53,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:31:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-03 23:31:53,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:31:53,949 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:31:53,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57273549] [2025-03-03 23:31:53,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57273549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:31:53,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:31:53,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 23:31:53,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378697539] [2025-03-03 23:31:53,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:31:53,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:31:53,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:31:53,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:31:53,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 23:31:53,950 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:31:54,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:31:54,280 INFO L93 Difference]: Finished difference Result 154 states and 226 transitions. [2025-03-03 23:31:54,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:31:54,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2025-03-03 23:31:54,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:31:54,285 INFO L225 Difference]: With dead ends: 154 [2025-03-03 23:31:54,285 INFO L226 Difference]: Without dead ends: 104 [2025-03-03 23:31:54,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:31:54,286 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 45 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:31:54,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 282 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:31:54,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-03 23:31:54,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 86. [2025-03-03 23:31:54,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 23:31:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 125 transitions. [2025-03-03 23:31:54,309 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 125 transitions. Word has length 107 [2025-03-03 23:31:54,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:31:54,309 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 125 transitions. [2025-03-03 23:31:54,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-03 23:31:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 125 transitions. [2025-03-03 23:31:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 23:31:54,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:31:54,313 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:31:54,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 23:31:54,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:31:54,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:31:54,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:31:54,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1407403374, now seen corresponding path program 1 times [2025-03-03 23:31:54,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:31:54,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497911073] [2025-03-03 23:31:54,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:31:54,515 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:31:54,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:31:54,517 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:31:54,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 23:31:54,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 23:31:54,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 23:31:54,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:31:54,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:31:54,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 23:31:54,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:32:23,550 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 23:32:48,249 WARN L286 SmtUtils]: Spent 20.35s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 23:33:09,215 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)