./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.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 80d0dbd642f174f1d467e22c7cd881540a5b30cdbb6826a74a2a8a7b559c2f1a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:32:21,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:32:21,323 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:32:21,329 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:32:21,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:32:21,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:32:21,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:32:21,356 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:32:21,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:32:21,357 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:32:21,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:32:21,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:32:21,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:32:21,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:32:21,359 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:32:21,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:32:21,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:32:21,359 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:32:21,359 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:32:21,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:32:21,359 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:32:21,359 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:32:21,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:32:21,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:32:21,360 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:32:21,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:32:21,360 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:32:21,360 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:32:21,360 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:32:21,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:32:21,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:32:21,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:32:21,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:32:21,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:32:21,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:32:21,361 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:32:21,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:32:21,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:32:21,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:32:21,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:32:21,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:32:21,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:32:21,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:32:21,362 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 -> 80d0dbd642f174f1d467e22c7cd881540a5b30cdbb6826a74a2a8a7b559c2f1a [2025-03-17 03:32:21,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:32:21,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:32:21,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:32:21,618 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:32:21,618 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:32:21,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i [2025-03-17 03:32:23,541 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a71e88e39/9cb08e22e76b467b945f1a487034c7e1/FLAG7a3f4b50b [2025-03-17 03:32:23,798 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:32:23,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i [2025-03-17 03:32:23,805 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a71e88e39/9cb08e22e76b467b945f1a487034c7e1/FLAG7a3f4b50b [2025-03-17 03:32:24,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a71e88e39/9cb08e22e76b467b945f1a487034c7e1 [2025-03-17 03:32:24,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:32:24,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:32:24,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:32:24,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:32:24,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:32:24,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:32:24" (1/1) ... [2025-03-17 03:32:24,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f63bb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:24, skipping insertion in model container [2025-03-17 03:32:24,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:32:24" (1/1) ... [2025-03-17 03:32:24,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:32:24,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i[915,928] [2025-03-17 03:32:24,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:32:24,276 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:32:24,285 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i[915,928] [2025-03-17 03:32:24,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:32:24,330 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:32:24,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:24 WrapperNode [2025-03-17 03:32:24,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:32:24,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:32:24,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:32:24,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:32:24,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:24" (1/1) ... [2025-03-17 03:32:24,345 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:24" (1/1) ... [2025-03-17 03:32:24,377 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-03-17 03:32:24,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:32:24,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:32:24,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:32:24,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:32:24,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:24" (1/1) ... [2025-03-17 03:32:24,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:24" (1/1) ... [2025-03-17 03:32:24,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:24" (1/1) ... [2025-03-17 03:32:24,408 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:32:24,408 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:24" (1/1) ... [2025-03-17 03:32:24,408 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:24" (1/1) ... [2025-03-17 03:32:24,412 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:24" (1/1) ... [2025-03-17 03:32:24,413 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:24" (1/1) ... [2025-03-17 03:32:24,415 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:24" (1/1) ... [2025-03-17 03:32:24,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:24" (1/1) ... [2025-03-17 03:32:24,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:32:24,424 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:32:24,424 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:32:24,424 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:32:24,428 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:24" (1/1) ... [2025-03-17 03:32:24,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:32:24,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:32:24,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:32:24,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:32:24,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:32:24,475 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:32:24,475 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:32:24,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:32:24,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:32:24,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:32:24,527 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:32:24,529 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:32:24,776 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 03:32:24,777 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:32:24,789 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:32:24,791 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:32:24,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:32:24 BoogieIcfgContainer [2025-03-17 03:32:24,791 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:32:24,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:32:24,793 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:32:24,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:32:24,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:32:24" (1/3) ... [2025-03-17 03:32:24,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50712721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:32:24, skipping insertion in model container [2025-03-17 03:32:24,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:24" (2/3) ... [2025-03-17 03:32:24,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50712721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:32:24, skipping insertion in model container [2025-03-17 03:32:24,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:32:24" (3/3) ... [2025-03-17 03:32:24,800 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-77.i [2025-03-17 03:32:24,812 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:32:24,814 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-77.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:32:24,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:32:24,873 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;@12f5835a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:32:24,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:32:24,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:32:24,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 03:32:24,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:32:24,886 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:32:24,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:32:24,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:32:24,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1479551599, now seen corresponding path program 1 times [2025-03-17 03:32:24,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:32:24,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970362713] [2025-03-17 03:32:24,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:32:24,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:32:24,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 03:32:24,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 03:32:24,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:32:24,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:32:25,118 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 03:32:25,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:32:25,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970362713] [2025-03-17 03:32:25,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970362713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:32:25,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145707771] [2025-03-17 03:32:25,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:32:25,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:32:25,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:32:25,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 03:32:25,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 03:32:25,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 03:32:25,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 03:32:25,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:32:25,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:32:25,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:32:25,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:32:25,274 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 03:32:25,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:32:25,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145707771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:32:25,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:32:25,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:32:25,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542875513] [2025-03-17 03:32:25,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:32:25,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:32:25,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:32:25,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:32:25,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:32:25,298 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 03:32:25,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:32:25,315 INFO L93 Difference]: Finished difference Result 85 states and 140 transitions. [2025-03-17 03:32:25,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:32:25,317 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2025-03-17 03:32:25,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:32:25,322 INFO L225 Difference]: With dead ends: 85 [2025-03-17 03:32:25,322 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 03:32:25,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:32:25,327 INFO L435 NwaCegarLoop]: 61 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, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:32:25,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:32:25,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 03:32:25,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 03:32:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:32:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2025-03-17 03:32:25,379 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 94 [2025-03-17 03:32:25,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:32:25,379 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2025-03-17 03:32:25,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 03:32:25,379 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2025-03-17 03:32:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 03:32:25,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:32:25,382 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:32:25,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 03:32:25,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 03:32:25,587 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:32:25,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:32:25,588 INFO L85 PathProgramCache]: Analyzing trace with hash 774166796, now seen corresponding path program 1 times [2025-03-17 03:32:25,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:32:25,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863156856] [2025-03-17 03:32:25,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:32:25,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:32:25,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 03:32:25,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 03:32:25,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:32:25,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:32:25,719 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:32:25,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 03:32:25,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 03:32:25,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:32:25,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:32:25,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:32:25,821 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:32:25,821 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:32:25,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 03:32:25,825 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 03:32:25,879 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:32:25,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:32:25 BoogieIcfgContainer [2025-03-17 03:32:25,883 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:32:25,883 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:32:25,883 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:32:25,883 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:32:25,884 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:32:24" (3/4) ... [2025-03-17 03:32:25,885 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:32:25,886 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:32:25,887 INFO L158 Benchmark]: Toolchain (without parser) took 1793.19ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 84.6MB in the end (delta: 26.6MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2025-03-17 03:32:25,887 INFO L158 Benchmark]: CDTParser took 1.24ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:32:25,887 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.84ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 98.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:32:25,887 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.14ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 03:32:25,887 INFO L158 Benchmark]: Boogie Preprocessor took 39.69ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 92.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:32:25,888 INFO L158 Benchmark]: IcfgBuilder took 368.26ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 75.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:32:25,888 INFO L158 Benchmark]: TraceAbstraction took 1089.39ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 85.0MB in the end (delta: -10.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:32:25,888 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 84.6MB in the end (delta: 473.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:32:25,889 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.24ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.84ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 98.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.14ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.69ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 92.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 368.26ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 75.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1089.39ms. Allocated memory is still 142.6MB. Free memory was 74.4MB in the beginning and 85.0MB in the end (delta: -10.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 84.6MB in the end (delta: 473.2kB). 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 73, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 46, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryArithmeticFLOAToperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 50; [L23] unsigned short int var_1_4 = 60871; [L24] unsigned short int var_1_5 = 1; [L25] unsigned short int var_1_6 = 28896; [L26] unsigned short int var_1_7 = 5; [L27] float var_1_8 = 63.8; [L28] float var_1_9 = 49.5; [L29] float var_1_10 = 31.875; [L30] float var_1_11 = 255.25; [L31] unsigned short int var_1_12 = 0; [L32] unsigned char var_1_13 = 0; [L33] unsigned char var_1_14 = 1; [L34] float var_1_16 = 0.8; [L35] unsigned short int var_1_17 = 64; [L92] isInitial = 1 [L93] FCALL initially() [L94] int k_loop; [L95] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=60871, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L95] COND TRUE k_loop < 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L60] var_1_4 = __VERIFIER_nondet_ushort() [L61] CALL assume_abort_if_not(var_1_4 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L61] RET assume_abort_if_not(var_1_4 >= 32767) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L62] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L62] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=1, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L63] var_1_5 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L64] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L65] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L65] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=28896, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L66] var_1_6 = __VERIFIER_nondet_ushort() [L67] CALL assume_abort_if_not(var_1_6 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L67] RET assume_abort_if_not(var_1_6 >= 16383) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L68] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L68] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=5, var_1_8=319/5, var_1_9=99/2] [L69] var_1_7 = __VERIFIER_nondet_ushort() [L70] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_8=319/5, var_1_9=99/2] [L70] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_8=319/5, var_1_9=99/2] [L71] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5, var_1_9=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5, var_1_9=99/2] [L71] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5, var_1_9=99/2] [L72] var_1_9 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L73] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=255/8, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L74] var_1_10 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L75] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1021/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L76] var_1_11 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L77] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L78] var_1_13 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L79] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_12=0, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L80] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L80] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L81] var_1_14 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L82] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_12=0, var_1_13=-256, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L83] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L83] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536, var_1_8=319/5] [L97] RET updateVariables() [L98] CALL step() [L39] COND FALSE !(var_1_7 > var_1_5) [L42] var_1_8 = (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - 1.6f) VAL [isInitial=1, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=4/5, var_1_17=64, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536] [L44] var_1_16 = var_1_11 [L45] var_1_17 = var_1_5 VAL [isInitial=1, var_1_11=60876, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=60876, var_1_17=32767, var_1_1=50, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536] [L46] COND TRUE var_1_8 != var_1_16 [L47] var_1_1 = (var_1_4 - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7))))) VAL [isInitial=1, var_1_11=60876, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=60876, var_1_17=32767, var_1_1=0, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536] [L49] unsigned char stepLocal_1 = var_1_13; [L50] signed long int stepLocal_0 = (((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)); VAL [isInitial=1, stepLocal_0=32767, stepLocal_1=-256, var_1_11=60876, var_1_12=0, var_1_13=-256, var_1_14=1, var_1_16=60876, var_1_17=32767, var_1_1=0, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536] [L51] COND FALSE !(stepLocal_1 && var_1_14) [L56] var_1_12 = 64 VAL [isInitial=1, stepLocal_0=32767, var_1_11=60876, var_1_12=64, var_1_13=-256, var_1_14=1, var_1_16=60876, var_1_17=32767, var_1_1=0, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536] [L98] RET step() [L99] CALL, EXPR property() [L88-L89] return (((((var_1_8 != var_1_16) ? (var_1_1 == ((unsigned short int) (var_1_4 - ((((var_1_5) < ((var_1_6 - var_1_7))) ? (var_1_5) : ((var_1_6 - var_1_7))))))) : 1) && ((var_1_7 > var_1_5) ? (var_1_8 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_8 == ((float) (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - 1.6f))))) && ((var_1_13 && var_1_14) ? ((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6))) < ((((32) > ((var_1_1 - var_1_7))) ? (32) : ((var_1_1 - var_1_7))))) ? (var_1_12 == ((unsigned short int) (var_1_7 + 5))) : 1) : (var_1_12 == ((unsigned short int) 64)))) && (var_1_16 == ((float) var_1_11))) && (var_1_17 == ((unsigned short int) var_1_5)) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=60876, var_1_12=64, var_1_13=-256, var_1_14=1, var_1_16=60876, var_1_17=32767, var_1_1=0, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536] [L19] reach_error() VAL [isInitial=1, var_1_11=60876, var_1_12=64, var_1_13=-256, var_1_14=1, var_1_16=60876, var_1_17=32767, var_1_1=0, var_1_4=-2147385345, var_1_5=32767, var_1_6=32767, var_1_7=-65536] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 78 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 61 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 186 SizeOfPredicates, 0 NumberOfNonLiveVariables, 226 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 812/840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 03:32:25,905 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_25-1loop_file-77.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 80d0dbd642f174f1d467e22c7cd881540a5b30cdbb6826a74a2a8a7b559c2f1a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:32:27,958 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:32:28,039 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:32:28,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:32:28,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:32:28,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:32:28,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:32:28,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:32:28,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:32:28,088 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:32:28,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:32:28,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:32:28,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:32:28,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:32:28,090 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:32:28,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:32:28,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:32:28,090 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:32:28,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:32:28,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:32:28,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:32:28,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:32:28,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:32:28,091 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:32:28,091 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:32:28,091 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:32:28,091 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:32:28,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:32:28,092 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:32:28,092 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:32:28,092 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:32:28,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:32:28,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:32:28,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:32:28,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:32:28,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:32:28,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:32:28,093 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:32:28,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:32:28,093 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:32:28,093 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:32:28,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:32:28,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:32:28,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:32:28,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:32:28,094 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 -> 80d0dbd642f174f1d467e22c7cd881540a5b30cdbb6826a74a2a8a7b559c2f1a [2025-03-17 03:32:28,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:32:28,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:32:28,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:32:28,440 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:32:28,440 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:32:28,441 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i [2025-03-17 03:32:29,685 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0419b6a4/4447f175122944aa8f8b01718faa8733/FLAG0c8165bc5 [2025-03-17 03:32:29,895 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:32:29,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i [2025-03-17 03:32:29,904 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0419b6a4/4447f175122944aa8f8b01718faa8733/FLAG0c8165bc5 [2025-03-17 03:32:29,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0419b6a4/4447f175122944aa8f8b01718faa8733 [2025-03-17 03:32:29,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:32:29,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:32:29,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:32:29,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:32:29,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:32:29,931 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:32:29" (1/1) ... [2025-03-17 03:32:29,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e9da3a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:29, skipping insertion in model container [2025-03-17 03:32:29,932 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:32:29" (1/1) ... [2025-03-17 03:32:29,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:32:30,065 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i[915,928] [2025-03-17 03:32:30,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:32:30,134 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:32:30,147 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-77.i[915,928] [2025-03-17 03:32:30,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:32:30,193 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:32:30,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:30 WrapperNode [2025-03-17 03:32:30,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:32:30,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:32:30,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:32:30,196 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:32:30,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:30" (1/1) ... [2025-03-17 03:32:30,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:30" (1/1) ... [2025-03-17 03:32:30,242 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2025-03-17 03:32:30,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:32:30,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:32:30,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:32:30,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:32:30,251 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:30" (1/1) ... [2025-03-17 03:32:30,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:30" (1/1) ... [2025-03-17 03:32:30,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:30" (1/1) ... [2025-03-17 03:32:30,269 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 03:32:30,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:30" (1/1) ... [2025-03-17 03:32:30,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:30" (1/1) ... [2025-03-17 03:32:30,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:30" (1/1) ... [2025-03-17 03:32:30,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:30" (1/1) ... [2025-03-17 03:32:30,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:30" (1/1) ... [2025-03-17 03:32:30,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:30" (1/1) ... [2025-03-17 03:32:30,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:32:30,294 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:32:30,295 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:32:30,295 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:32:30,296 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:30" (1/1) ... [2025-03-17 03:32:30,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:32:30,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:32:30,331 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 03:32:30,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 03:32:30,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:32:30,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:32:30,356 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:32:30,357 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:32:30,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:32:30,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:32:30,425 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:32:30,427 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:32:30,741 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 03:32:30,741 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:32:30,753 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:32:30,754 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:32:30,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:32:30 BoogieIcfgContainer [2025-03-17 03:32:30,755 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:32:30,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:32:30,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:32:30,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:32:30,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:32:29" (1/3) ... [2025-03-17 03:32:30,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7306aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:32:30, skipping insertion in model container [2025-03-17 03:32:30,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:32:30" (2/3) ... [2025-03-17 03:32:30,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7306aefe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:32:30, skipping insertion in model container [2025-03-17 03:32:30,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:32:30" (3/3) ... [2025-03-17 03:32:30,764 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-77.i [2025-03-17 03:32:30,777 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:32:30,778 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-77.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:32:30,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:32:30,834 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;@1ac13e47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:32:30,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:32:30,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:32:30,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 03:32:30,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:32:30,845 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:32:30,845 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:32:30,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:32:30,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1479551599, now seen corresponding path program 1 times [2025-03-17 03:32:30,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:32:30,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406092059] [2025-03-17 03:32:30,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:32:30,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:32:30,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:32:30,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:32:30,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 03:32:30,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 03:32:31,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 03:32:31,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:32:31,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:32:31,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:32:31,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:32:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 03:32:31,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:32:31,091 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:32:31,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406092059] [2025-03-17 03:32:31,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406092059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:32:31,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:32:31,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:32:31,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712023221] [2025-03-17 03:32:31,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:32:31,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:32:31,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:32:31,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:32:31,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:32:31,111 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 03:32:31,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:32:31,125 INFO L93 Difference]: Finished difference Result 85 states and 140 transitions. [2025-03-17 03:32:31,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:32:31,127 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2025-03-17 03:32:31,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:32:31,131 INFO L225 Difference]: With dead ends: 85 [2025-03-17 03:32:31,131 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 03:32:31,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:32:31,135 INFO L435 NwaCegarLoop]: 61 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, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 03:32:31,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:32:31,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 03:32:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 03:32:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 03:32:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2025-03-17 03:32:31,189 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 94 [2025-03-17 03:32:31,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:32:31,189 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2025-03-17 03:32:31,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 03:32:31,190 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2025-03-17 03:32:31,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 03:32:31,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:32:31,193 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:32:31,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 03:32:31,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:32:31,394 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:32:31,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:32:31,394 INFO L85 PathProgramCache]: Analyzing trace with hash 774166796, now seen corresponding path program 1 times [2025-03-17 03:32:31,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:32:31,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201621433] [2025-03-17 03:32:31,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:32:31,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 03:32:31,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:32:31,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 03:32:31,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 03:32:31,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 03:32:31,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 03:32:31,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:32:31,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:32:31,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 03:32:31,573 INFO L279 TraceCheckSpWp]: Computing forward predicates...