./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-89.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-while_file-89.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 5fdfeb035fc720c7508db6c2fc50925f9388f49a7099d6826b0d08b54f402c28 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:45:03,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:45:03,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 03:45:03,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:45:03,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:45:03,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:45:03,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:45:03,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:45:03,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:45:03,626 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:45:03,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:45:03,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:45:03,627 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:45:03,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:45:03,627 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:45:03,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:45:03,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:45:03,627 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:45:03,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 03:45:03,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:45:03,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:45:03,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:45:03,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:45:03,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:45:03,628 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:45:03,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:45:03,628 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:45:03,628 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:45:03,628 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:45:03,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:45:03,629 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:45:03,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:45:03,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:45:03,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:45:03,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:45:03,629 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:45:03,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:45:03,629 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 03:45:03,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 03:45:03,630 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:45:03,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:45:03,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:45:03,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:45:03,630 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 -> 5fdfeb035fc720c7508db6c2fc50925f9388f49a7099d6826b0d08b54f402c28 [2025-03-17 03:45:03,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:45:03,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:45:03,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:45:03,866 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:45:03,867 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:45:03,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-89.i [2025-03-17 03:45:04,998 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456d65f11/f547ed2bf3c34938ac2092c0ee4ed5ba/FLAG443a71b0a [2025-03-17 03:45:05,224 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:45:05,224 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-89.i [2025-03-17 03:45:05,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456d65f11/f547ed2bf3c34938ac2092c0ee4ed5ba/FLAG443a71b0a [2025-03-17 03:45:05,241 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/456d65f11/f547ed2bf3c34938ac2092c0ee4ed5ba [2025-03-17 03:45:05,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:45:05,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:45:05,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:45:05,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:45:05,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:45:05,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:45:05" (1/1) ... [2025-03-17 03:45:05,248 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@460fda9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:05, skipping insertion in model container [2025-03-17 03:45:05,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:45:05" (1/1) ... [2025-03-17 03:45:05,260 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:45:05,353 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-while_file-89.i[915,928] [2025-03-17 03:45:05,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:45:05,401 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:45:05,409 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-while_file-89.i[915,928] [2025-03-17 03:45:05,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:45:05,434 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:45:05,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:05 WrapperNode [2025-03-17 03:45:05,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:45:05,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:45:05,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:45:05,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:45:05,440 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:45:05" (1/1) ... [2025-03-17 03:45:05,447 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:45:05" (1/1) ... [2025-03-17 03:45:05,465 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 108 [2025-03-17 03:45:05,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:45:05,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:45:05,466 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:45:05,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:45:05,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:05" (1/1) ... [2025-03-17 03:45:05,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:05" (1/1) ... [2025-03-17 03:45:05,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:05" (1/1) ... [2025-03-17 03:45:05,494 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:45:05,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:05" (1/1) ... [2025-03-17 03:45:05,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:05" (1/1) ... [2025-03-17 03:45:05,499 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:05" (1/1) ... [2025-03-17 03:45:05,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:05" (1/1) ... [2025-03-17 03:45:05,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:05" (1/1) ... [2025-03-17 03:45:05,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:05" (1/1) ... [2025-03-17 03:45:05,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:45:05,507 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:45:05,508 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:45:05,508 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:45:05,508 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:05" (1/1) ... [2025-03-17 03:45:05,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:45:05,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:45:05,542 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:45:05,547 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:45:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:45:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:45:05,564 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:45:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 03:45:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:45:05,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:45:05,630 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:45:05,632 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:45:05,826 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 03:45:05,832 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:45:05,843 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:45:05,843 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:45:05,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:05 BoogieIcfgContainer [2025-03-17 03:45:05,844 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:45:05,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:45:05,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:45:05,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:45:05,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:45:05" (1/3) ... [2025-03-17 03:45:05,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c42c396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:45:05, skipping insertion in model container [2025-03-17 03:45:05,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:05" (2/3) ... [2025-03-17 03:45:05,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c42c396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:45:05, skipping insertion in model container [2025-03-17 03:45:05,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:05" (3/3) ... [2025-03-17 03:45:05,852 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-89.i [2025-03-17 03:45:05,864 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:45:05,865 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-89.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:45:05,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:45:05,919 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;@147ca189, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:45:05,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:45:05,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:45:05,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 03:45:05,933 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:45:05,933 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:45:05,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:45:05,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:45:05,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1019729529, now seen corresponding path program 1 times [2025-03-17 03:45:05,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:45:05,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830264521] [2025-03-17 03:45:05,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:45:05,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:45:06,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 03:45:06,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 03:45:06,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:06,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:45:06,182 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 03:45:06,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 03:45:06,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830264521] [2025-03-17 03:45:06,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830264521] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 03:45:06,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948380153] [2025-03-17 03:45:06,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:45:06,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:45:06,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:45:06,187 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:45:06,189 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:45:06,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 03:45:06,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 03:45:06,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:06,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:45:06,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:45:06,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:45:06,345 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 03:45:06,345 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:45:06,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948380153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:45:06,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 03:45:06,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 03:45:06,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794353264] [2025-03-17 03:45:06,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:45:06,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:45:06,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 03:45:06,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:45:06,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:45:06,370 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 03:45:06,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:45:06,409 INFO L93 Difference]: Finished difference Result 93 states and 159 transitions. [2025-03-17 03:45:06,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:45:06,410 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2025-03-17 03:45:06,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:45:06,415 INFO L225 Difference]: With dead ends: 93 [2025-03-17 03:45:06,416 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 03:45:06,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 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:45:06,422 INFO L435 NwaCegarLoop]: 67 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, 67 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:45:06,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:45:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 03:45:06,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 03:45:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:45:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2025-03-17 03:45:06,463 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 116 [2025-03-17 03:45:06,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:45:06,463 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2025-03-17 03:45:06,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 03:45:06,464 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2025-03-17 03:45:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 03:45:06,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:45:06,469 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:45:06,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 03:45:06,670 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:45:06,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:45:06,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:45:06,672 INFO L85 PathProgramCache]: Analyzing trace with hash 435773590, now seen corresponding path program 1 times [2025-03-17 03:45:06,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 03:45:06,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401342303] [2025-03-17 03:45:06,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:45:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 03:45:06,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 03:45:06,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 03:45:06,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:06,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 03:45:06,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1256545825] [2025-03-17 03:45:06,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:45:06,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 03:45:06,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:45:06,800 INFO L229 MonitoredProcess]: Starting monitored process 3 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:45:06,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 03:45:06,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 03:45:06,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 03:45:06,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:06,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:45:06,913 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 03:45:06,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 03:45:06,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 03:45:06,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:06,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 03:45:07,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 03:45:07,004 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 03:45:07,005 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 03:45:07,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 03:45:07,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 03:45:07,210 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 03:45:07,268 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 03:45:07,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:45:07 BoogieIcfgContainer [2025-03-17 03:45:07,272 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 03:45:07,273 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 03:45:07,273 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 03:45:07,273 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 03:45:07,274 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:05" (3/4) ... [2025-03-17 03:45:07,276 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 03:45:07,276 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 03:45:07,277 INFO L158 Benchmark]: Toolchain (without parser) took 2033.59ms. Allocated memory is still 142.6MB. Free memory was 105.6MB in the beginning and 69.9MB in the end (delta: 35.6MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2025-03-17 03:45:07,277 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:45:07,277 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.05ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 92.5MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:45:07,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.56ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:45:07,278 INFO L158 Benchmark]: Boogie Preprocessor took 37.92ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 86.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:45:07,278 INFO L158 Benchmark]: IcfgBuilder took 336.24ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 69.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 03:45:07,278 INFO L158 Benchmark]: TraceAbstraction took 1426.25ms. Allocated memory is still 142.6MB. Free memory was 69.1MB in the beginning and 70.0MB in the end (delta: -833.3kB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2025-03-17 03:45:07,279 INFO L158 Benchmark]: Witness Printer took 3.89ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 69.9MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 03:45:07,280 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.05ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 92.5MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.56ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 89.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.92ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 86.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 336.24ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 69.1MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1426.25ms. Allocated memory is still 142.6MB. Free memory was 69.1MB in the beginning and 70.0MB in the end (delta: -833.3kB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Witness Printer took 3.89ms. Allocated memory is still 142.6MB. Free memory was 70.0MB in the beginning and 69.9MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 52, overapproximation of someUnaryDOUBLEoperation at line 31, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 85. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 5; [L24] unsigned char var_1_3 = 4; [L25] signed long int var_1_4 = -256; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 0; [L30] double var_1_9 = 9.5; [L31] double var_1_10 = -0.4; [L32] double var_1_11 = 31.5; [L33] double var_1_12 = 16.25; [L34] double var_1_13 = 127.5; [L35] double var_1_14 = 100000.5; [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L56] var_1_2 = __VERIFIER_nondet_uchar() [L57] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L57] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L58] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L58] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=4, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L59] var_1_3 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L60] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L61] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L61] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L62] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L62] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L63] var_1_4 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L64] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L65] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L65] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=0, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L66] var_1_5 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L67] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L68] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L68] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L70] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=19/2] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_8=0, var_1_9=19/2] [L74] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L74] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L75] var_1_8 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=19/2] [L76] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_9=19/2] [L77] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L77] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L78] var_1_10 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && 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=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L79] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_12=65/4, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L80] var_1_12 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L81] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_13=255/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L82] var_1_13 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L83] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_14=200001/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L84] var_1_14 = __VERIFIER_nondet_double() [L85] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L85] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=63/2, var_1_1=0, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L98] RET updateVariables() [L99] CALL step() [L39] COND TRUE (var_1_2 / var_1_3) >= var_1_4 [L40] var_1_1 = (var_1_5 && var_1_6) VAL [isInitial=1, var_1_11=63/2, var_1_1=1, var_1_2=-251, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L44] unsigned char stepLocal_0 = (var_1_6 && var_1_8) || (var_1_2 >= 5); VAL [isInitial=1, stepLocal_0=1, var_1_11=63/2, var_1_1=1, var_1_2=-251, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=19/2] [L45] COND TRUE stepLocal_0 && (var_1_3 < var_1_4) [L46] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=2, var_1_11=63/2, var_1_1=1, var_1_2=-251, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L50] unsigned char stepLocal_1 = var_1_6; VAL [isInitial=1, stepLocal_1=1, var_1_10=2, var_1_11=63/2, var_1_1=1, var_1_2=-251, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L51] COND TRUE (((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) > ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))) || stepLocal_1 [L52] var_1_11 = (((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))) + var_1_14) VAL [isInitial=1, var_1_10=2, var_1_1=1, var_1_2=-251, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L99] RET step() [L100] CALL, EXPR property() [L90-L91] return ((((var_1_2 / var_1_3) >= var_1_4) ? (var_1_1 == ((unsigned char) (var_1_5 && var_1_6))) : (var_1_1 == ((unsigned char) ((var_1_3 >= var_1_2) && (var_1_7 || var_1_8))))) && ((((var_1_6 && var_1_8) || (var_1_2 >= 5)) && (var_1_3 < var_1_4)) ? (var_1_9 == ((double) var_1_10)) : (var_1_9 == ((double) var_1_10)))) && (((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) > ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))) || var_1_6) ? (var_1_11 == ((double) (((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))) + var_1_14))) : 1) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_1=1, var_1_2=-251, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_1=1, var_1_2=-251, var_1_3=257, var_1_4=2, var_1_5=1, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 48 locations, 90 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 67 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, 67 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 258 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1332/1368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 03:45:07,296 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-while_file-89.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 5fdfeb035fc720c7508db6c2fc50925f9388f49a7099d6826b0d08b54f402c28 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 03:45:09,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 03:45:09,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 03:45:09,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 03:45:09,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 03:45:09,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 03:45:09,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 03:45:09,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 03:45:09,238 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 03:45:09,238 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 03:45:09,238 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 03:45:09,238 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 03:45:09,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 03:45:09,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 03:45:09,239 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 03:45:09,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 03:45:09,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 03:45:09,239 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 03:45:09,239 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 03:45:09,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 03:45:09,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 03:45:09,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 03:45:09,239 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 03:45:09,239 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 03:45:09,239 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 03:45:09,239 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 03:45:09,239 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 03:45:09,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 03:45:09,239 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 03:45:09,240 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 03:45:09,240 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 03:45:09,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 03:45:09,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 03:45:09,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 03:45:09,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:45:09,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 03:45:09,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 03:45:09,240 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 03:45:09,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 03:45:09,240 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 03:45:09,240 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 03:45:09,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 03:45:09,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 03:45:09,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 03:45:09,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 03:45:09,240 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 -> 5fdfeb035fc720c7508db6c2fc50925f9388f49a7099d6826b0d08b54f402c28 [2025-03-17 03:45:09,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 03:45:09,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 03:45:09,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 03:45:09,517 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 03:45:09,517 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 03:45:09,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-89.i [2025-03-17 03:45:10,720 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c7544189/8d0dd45d95ce4f78a085eb49c70187ce/FLAG70a43d52b [2025-03-17 03:45:10,910 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 03:45:10,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-89.i [2025-03-17 03:45:10,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c7544189/8d0dd45d95ce4f78a085eb49c70187ce/FLAG70a43d52b [2025-03-17 03:45:10,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c7544189/8d0dd45d95ce4f78a085eb49c70187ce [2025-03-17 03:45:10,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 03:45:10,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 03:45:10,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 03:45:10,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 03:45:10,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 03:45:10,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:45:10" (1/1) ... [2025-03-17 03:45:10,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@799fe5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:10, skipping insertion in model container [2025-03-17 03:45:10,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:45:10" (1/1) ... [2025-03-17 03:45:10,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 03:45:11,049 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-while_file-89.i[915,928] [2025-03-17 03:45:11,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:45:11,089 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 03:45:11,102 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-while_file-89.i[915,928] [2025-03-17 03:45:11,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 03:45:11,128 INFO L204 MainTranslator]: Completed translation [2025-03-17 03:45:11,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:11 WrapperNode [2025-03-17 03:45:11,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 03:45:11,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 03:45:11,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 03:45:11,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 03:45:11,134 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:45:11" (1/1) ... [2025-03-17 03:45:11,142 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:45:11" (1/1) ... [2025-03-17 03:45:11,157 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2025-03-17 03:45:11,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 03:45:11,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 03:45:11,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 03:45:11,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 03:45:11,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:11" (1/1) ... [2025-03-17 03:45:11,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:11" (1/1) ... [2025-03-17 03:45:11,167 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:11" (1/1) ... [2025-03-17 03:45:11,176 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:45:11,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:11" (1/1) ... [2025-03-17 03:45:11,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:11" (1/1) ... [2025-03-17 03:45:11,183 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:11" (1/1) ... [2025-03-17 03:45:11,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:11" (1/1) ... [2025-03-17 03:45:11,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:11" (1/1) ... [2025-03-17 03:45:11,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:11" (1/1) ... [2025-03-17 03:45:11,187 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 03:45:11,188 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 03:45:11,188 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 03:45:11,188 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 03:45:11,189 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:11" (1/1) ... [2025-03-17 03:45:11,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 03:45:11,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 03:45:11,215 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:45:11,221 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:45:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 03:45:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 03:45:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 03:45:11,239 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 03:45:11,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 03:45:11,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 03:45:11,294 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 03:45:11,296 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 03:45:11,933 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 03:45:11,934 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 03:45:11,944 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 03:45:11,944 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 03:45:11,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:11 BoogieIcfgContainer [2025-03-17 03:45:11,945 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 03:45:11,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 03:45:11,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 03:45:11,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 03:45:11,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:45:10" (1/3) ... [2025-03-17 03:45:11,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11965e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:45:11, skipping insertion in model container [2025-03-17 03:45:11,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:45:11" (2/3) ... [2025-03-17 03:45:11,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11965e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:45:11, skipping insertion in model container [2025-03-17 03:45:11,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:45:11" (3/3) ... [2025-03-17 03:45:11,954 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-89.i [2025-03-17 03:45:11,965 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 03:45:11,966 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-89.i that has 2 procedures, 48 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 03:45:12,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 03:45:12,020 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;@301c1a6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 03:45:12,020 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 03:45:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:45:12,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 03:45:12,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:45:12,030 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:45:12,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:45:12,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:45:12,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1019729529, now seen corresponding path program 1 times [2025-03-17 03:45:12,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:45:12,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899241476] [2025-03-17 03:45:12,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:45:12,043 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:45:12,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:45:12,045 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:45:12,047 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:45:12,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 03:45:12,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 03:45:12,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:12,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:45:12,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 03:45:12,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:45:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-03-17 03:45:12,288 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 03:45:12,288 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 03:45:12,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899241476] [2025-03-17 03:45:12,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899241476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 03:45:12,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 03:45:12,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 03:45:12,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954516051] [2025-03-17 03:45:12,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 03:45:12,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 03:45:12,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 03:45:12,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 03:45:12,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 03:45:12,309 INFO L87 Difference]: Start difference. First operand has 48 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 27 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 03:45:12,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 03:45:12,324 INFO L93 Difference]: Finished difference Result 93 states and 159 transitions. [2025-03-17 03:45:12,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 03:45:12,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2025-03-17 03:45:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 03:45:12,342 INFO L225 Difference]: With dead ends: 93 [2025-03-17 03:45:12,343 INFO L226 Difference]: Without dead ends: 46 [2025-03-17 03:45:12,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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:45:12,350 INFO L435 NwaCegarLoop]: 67 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, 67 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:45:12,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 03:45:12,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-17 03:45:12,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-17 03:45:12,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 03:45:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2025-03-17 03:45:12,387 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 116 [2025-03-17 03:45:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 03:45:12,388 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2025-03-17 03:45:12,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 03:45:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2025-03-17 03:45:12,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-17 03:45:12,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 03:45:12,391 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 03:45:12,401 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-17 03:45:12,596 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:45:12,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 03:45:12,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 03:45:12,598 INFO L85 PathProgramCache]: Analyzing trace with hash 435773590, now seen corresponding path program 1 times [2025-03-17 03:45:12,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 03:45:12,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316150338] [2025-03-17 03:45:12,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 03:45:12,598 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:45:12,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 03:45:12,600 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:45:12,602 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:45:12,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-17 03:45:12,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-17 03:45:12,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 03:45:12,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 03:45:12,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 03:45:12,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 03:46:25,668 WARN L286 SmtUtils]: Spent 29.45s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)