./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-48.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 bdbdb0a57f8e7955fa347b2650d76001482f700f8541e178ab37930e0988af8a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:09:36,892 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:09:36,949 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:09:36,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:09:36,955 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:09:36,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:09:36,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:09:36,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:09:36,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:09:36,979 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:09:36,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:09:36,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:09:36,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:09:36,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:09:36,980 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:09:36,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:09:36,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:09:36,981 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:09:36,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:09:36,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:09:36,982 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:09:36,982 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:09:36,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:09:36,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:09:36,982 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:09:36,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:09:36,982 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:09:36,982 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:09:36,982 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:09:36,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:09:36,982 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:09:36,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:09:36,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:09:36,983 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:09:36,983 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:09:36,983 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:09:36,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:09:36,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:09:36,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:09:36,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:09:36,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:09:36,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:09:36,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:09:36,984 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 -> bdbdb0a57f8e7955fa347b2650d76001482f700f8541e178ab37930e0988af8a [2025-03-03 23:09:37,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:09:37,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:09:37,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:09:37,258 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:09:37,258 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:09:37,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-48.i [2025-03-03 23:09:38,426 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b02d2b51/c3cc4fd3161c46e98e82b2ce4d1d4703/FLAGa236727ca [2025-03-03 23:09:38,728 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:09:38,729 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-48.i [2025-03-03 23:09:38,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b02d2b51/c3cc4fd3161c46e98e82b2ce4d1d4703/FLAGa236727ca [2025-03-03 23:09:39,012 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b02d2b51/c3cc4fd3161c46e98e82b2ce4d1d4703 [2025-03-03 23:09:39,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:09:39,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:09:39,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:09:39,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:09:39,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:09:39,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:09:39" (1/1) ... [2025-03-03 23:09:39,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f13129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:39, skipping insertion in model container [2025-03-03 23:09:39,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:09:39" (1/1) ... [2025-03-03 23:09:39,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:09:39,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-48.i[915,928] [2025-03-03 23:09:39,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:09:39,203 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:09:39,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-48.i[915,928] [2025-03-03 23:09:39,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:09:39,245 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:09:39,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:39 WrapperNode [2025-03-03 23:09:39,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:09:39,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:09:39,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:09:39,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:09:39,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:39" (1/1) ... [2025-03-03 23:09:39,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:39" (1/1) ... [2025-03-03 23:09:39,273 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2025-03-03 23:09:39,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:09:39,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:09:39,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:09:39,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:09:39,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:39" (1/1) ... [2025-03-03 23:09:39,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:39" (1/1) ... [2025-03-03 23:09:39,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:39" (1/1) ... [2025-03-03 23:09:39,293 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:09:39,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:39" (1/1) ... [2025-03-03 23:09:39,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:39" (1/1) ... [2025-03-03 23:09:39,298 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:39" (1/1) ... [2025-03-03 23:09:39,299 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:39" (1/1) ... [2025-03-03 23:09:39,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:39" (1/1) ... [2025-03-03 23:09:39,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:39" (1/1) ... [2025-03-03 23:09:39,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:09:39,302 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:09:39,302 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:09:39,302 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:09:39,303 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:39" (1/1) ... [2025-03-03 23:09:39,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:09:39,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:09:39,334 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:09:39,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:09:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:09:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:09:39,353 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:09:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:09:39,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:09:39,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:09:39,403 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:09:39,404 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:09:39,573 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 23:09:39,574 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:09:39,582 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:09:39,582 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:09:39,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:09:39 BoogieIcfgContainer [2025-03-03 23:09:39,582 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:09:39,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:09:39,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:09:39,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:09:39,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:09:39" (1/3) ... [2025-03-03 23:09:39,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2e2a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:09:39, skipping insertion in model container [2025-03-03 23:09:39,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:39" (2/3) ... [2025-03-03 23:09:39,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2e2a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:09:39, skipping insertion in model container [2025-03-03 23:09:39,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:09:39" (3/3) ... [2025-03-03 23:09:39,589 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-48.i [2025-03-03 23:09:39,598 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:09:39,601 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-48.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:09:39,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:09:39,653 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;@4b7bd587, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:09:39,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:09:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 23:09:39,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 23:09:39,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:09:39,668 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:09:39,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:09:39,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:09:39,673 INFO L85 PathProgramCache]: Analyzing trace with hash -711253515, now seen corresponding path program 1 times [2025-03-03 23:09:39,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:09:39,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209914347] [2025-03-03 23:09:39,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:39,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:09:39,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 23:09:39,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 23:09:39,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:39,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:09:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-03 23:09:39,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:09:39,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209914347] [2025-03-03 23:09:39,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209914347] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:09:39,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973035749] [2025-03-03 23:09:39,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:39,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:09:39,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:09:39,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:09:39,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:09:39,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 23:09:39,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 23:09:39,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:39,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:09:39,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:09:39,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:09:39,993 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-03 23:09:39,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:09:39,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973035749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:09:39,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:09:39,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:09:39,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564336615] [2025-03-03 23:09:39,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:09:39,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:09:40,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:09:40,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:09:40,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:09:40,018 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 23:09:40,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:09:40,039 INFO L93 Difference]: Finished difference Result 109 states and 177 transitions. [2025-03-03 23:09:40,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:09:40,040 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2025-03-03 23:09:40,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:09:40,044 INFO L225 Difference]: With dead ends: 109 [2025-03-03 23:09:40,044 INFO L226 Difference]: Without dead ends: 53 [2025-03-03 23:09:40,047 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-03 23:09:40,052 INFO L435 NwaCegarLoop]: 79 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, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:09:40,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:09:40,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-03 23:09:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-03 23:09:40,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 23:09:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2025-03-03 23:09:40,084 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 116 [2025-03-03 23:09:40,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:09:40,084 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2025-03-03 23:09:40,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 23:09:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2025-03-03 23:09:40,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 23:09:40,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:09:40,088 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:09:40,094 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-03 23:09:40,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:09:40,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:09:40,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:09:40,290 INFO L85 PathProgramCache]: Analyzing trace with hash -999745665, now seen corresponding path program 1 times [2025-03-03 23:09:40,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:09:40,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162283573] [2025-03-03 23:09:40,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:40,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:09:40,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 23:09:40,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 23:09:40,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:40,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:09:40,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [767116382] [2025-03-03 23:09:40,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:40,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:09:40,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:09:40,400 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-03 23:09:40,401 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-03 23:09:40,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 23:09:40,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 23:09:40,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:40,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:09:40,510 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:09:40,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 23:09:40,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 23:09:40,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:40,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:09:40,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:09:40,611 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:09:40,611 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:09:40,619 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-03 23:09:40,813 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-03 23:09:40,816 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-03 23:09:40,865 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:09:40,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:09:40 BoogieIcfgContainer [2025-03-03 23:09:40,868 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:09:40,870 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:09:40,870 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:09:40,870 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:09:40,871 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:09:39" (3/4) ... [2025-03-03 23:09:40,872 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:09:40,873 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:09:40,874 INFO L158 Benchmark]: Toolchain (without parser) took 1859.08ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 105.3MB in the end (delta: 17.2MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2025-03-03 23:09:40,874 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:09:40,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.22ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 109.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:09:40,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.07ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:09:40,874 INFO L158 Benchmark]: Boogie Preprocessor took 27.84ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 105.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:09:40,874 INFO L158 Benchmark]: IcfgBuilder took 280.11ms. Allocated memory is still 167.8MB. Free memory was 105.1MB in the beginning and 89.8MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:09:40,875 INFO L158 Benchmark]: TraceAbstraction took 1284.31ms. Allocated memory is still 167.8MB. Free memory was 88.8MB in the beginning and 105.4MB in the end (delta: -16.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:09:40,875 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 105.3MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:09:40,876 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.27ms. Allocated memory is still 201.3MB. Free memory is still 119.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.22ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 109.4MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.07ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.5MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.84ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 105.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 280.11ms. Allocated memory is still 167.8MB. Free memory was 105.1MB in the beginning and 89.8MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1284.31ms. Allocated memory is still 167.8MB. Free memory was 88.8MB in the beginning and 105.4MB in the end (delta: -16.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 105.3MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 43, overapproximation of someBinaryFLOATComparisonOperation at line 56, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 78. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 32.8; [L23] float var_1_2 = 255.675; [L24] float var_1_3 = 5.5; [L25] float var_1_4 = 128.75; [L26] float var_1_5 = 4.5; [L27] float var_1_6 = 9.25; [L28] float var_1_7 = 3.75; [L29] float var_1_8 = 127.6; [L30] float var_1_9 = 256.5; [L31] float var_1_10 = 49.5; [L32] unsigned short int var_1_11 = 8; [L33] unsigned char var_1_12 = 0; [L34] unsigned short int var_1_13 = 256; [L35] unsigned char var_1_14 = 64; [L36] signed long int var_1_15 = -8; [L37] unsigned char var_1_16 = 10; [L38] float last_1_var_1_1 = 32.8; [L39] unsigned char last_1_var_1_14 = 64; VAL [isInitial=0, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_2=10227/40, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L108] isInitial = 1 [L109] FCALL initially() [L110] int k_loop; [L111] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_2=10227/40, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L111] COND TRUE k_loop < 1 [L112] CALL updateLastVariables() [L100] last_1_var_1_1 = var_1_1 [L101] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_2=10227/40, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L112] RET updateLastVariables() [L113] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_float() [L68] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L68] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_3=11/2, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L69] var_1_3 = __VERIFIER_nondet_float() [L70] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L70] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_4=515/4, var_1_5=9/2, var_1_6=37/4, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L71] var_1_4 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_5=9/2, var_1_6=37/4, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_5=9/2, var_1_6=37/4, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L72] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_5=9/2, var_1_6=37/4, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L73] var_1_5 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_6=37/4, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_6=37/4, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L74] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_6=37/4, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L75] var_1_6 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L76] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_7=15/4, var_1_8=638/5, var_1_9=513/2] [L77] var_1_7 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_8=638/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_8=638/5, var_1_9=513/2] [L78] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_8=638/5, var_1_9=513/2] [L79] var_1_8 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_9=513/2] [L80] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5, var_1_9=513/2] [L81] var_1_9 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L82] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_10=99/2, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L83] var_1_10 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L84] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=0, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L85] var_1_12 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L86] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L87] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L87] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=256, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L88] var_1_13 = __VERIFIER_nondet_ushort() [L89] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L89] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L90] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L90] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=-8, var_1_16=10, var_1_1=164/5] [L91] var_1_15 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=10, var_1_1=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=10, var_1_1=164/5] [L92] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=10, var_1_1=164/5] [L93] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=10, var_1_1=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=10, var_1_1=164/5] [L93] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=10, var_1_1=164/5] [L94] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=10, var_1_1=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=10, var_1_1=164/5] [L94] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=10, var_1_1=164/5] [L95] var_1_16 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_1=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_1=164/5] [L96] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_1=164/5] [L97] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=0, var_1_1=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=0, var_1_1=164/5] [L97] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=0, var_1_1=164/5] [L113] RET updateVariables() [L114] CALL step() [L43] COND FALSE !(! ((var_1_4 - var_1_10) < last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=0, var_1_1=164/5] [L48] signed long int stepLocal_0 = var_1_13 / var_1_15; VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, stepLocal_0=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=0, var_1_1=164/5] [L49] COND FALSE !(stepLocal_0 <= (-8 + var_1_11)) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=0, var_1_1=164/5] [L56] COND FALSE !(var_1_2 <= var_1_3) [L63] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=0, var_1_1=2, var_1_7=2] [L114] RET step() [L115] CALL, EXPR property() [L104-L105] return (((var_1_2 <= var_1_3) ? ((var_1_3 < ((var_1_4 - var_1_5) + 1.395f)) ? (var_1_1 == ((float) var_1_6)) : (var_1_1 == ((float) (((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))) + (var_1_9 - var_1_10))))) : (var_1_1 == ((float) var_1_7))) && ((! ((var_1_4 - var_1_10) < last_1_var_1_1)) ? (var_1_12 ? (var_1_11 == ((unsigned short int) last_1_var_1_14)) : 1) : 1)) && (((var_1_13 / var_1_15) <= (-8 + var_1_11)) ? ((! (64 < var_1_11)) ? (var_1_14 == ((unsigned char) var_1_16)) : (var_1_14 == ((unsigned char) var_1_16))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=0, var_1_1=2, var_1_7=2] [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=0, var_1_1=2, var_1_7=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=64, last_1_var_1_1=164/5, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=64, var_1_15=1, var_1_16=0, var_1_1=2, var_1_7=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 18, 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, 79 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, 79 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=56occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1190/1224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 23:09:40,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-48.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 bdbdb0a57f8e7955fa347b2650d76001482f700f8541e178ab37930e0988af8a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:09:42,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:09:42,666 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:09:42,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:09:42,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:09:42,709 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:09:42,710 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:09:42,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:09:42,711 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:09:42,711 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:09:42,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:09:42,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:09:42,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:09:42,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:09:42,712 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:09:42,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:09:42,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:09:42,713 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:09:42,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:09:42,713 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:09:42,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:09:42,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:09:42,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:09:42,713 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:09:42,713 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:09:42,713 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:09:42,713 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:09:42,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:09:42,714 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:09:42,714 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:09:42,714 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:09:42,714 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:09:42,714 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:09:42,714 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:09:42,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:09:42,714 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:09:42,715 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:09:42,715 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:09:42,715 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:09:42,715 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:09:42,715 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:09:42,715 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:09:42,715 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:09:42,721 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:09:42,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:09:42,721 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 -> bdbdb0a57f8e7955fa347b2650d76001482f700f8541e178ab37930e0988af8a [2025-03-03 23:09:42,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:09:42,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:09:42,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:09:42,947 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:09:42,948 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:09:42,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-48.i [2025-03-03 23:09:44,052 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e904e0efc/a62bd85d17964526936c70da93a388ed/FLAG0844bfc7b [2025-03-03 23:09:44,298 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:09:44,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-48.i [2025-03-03 23:09:44,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e904e0efc/a62bd85d17964526936c70da93a388ed/FLAG0844bfc7b [2025-03-03 23:09:44,322 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e904e0efc/a62bd85d17964526936c70da93a388ed [2025-03-03 23:09:44,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:09:44,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:09:44,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:09:44,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:09:44,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:09:44,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:09:44" (1/1) ... [2025-03-03 23:09:44,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31fe8698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:44, skipping insertion in model container [2025-03-03 23:09:44,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:09:44" (1/1) ... [2025-03-03 23:09:44,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:09:44,448 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-48.i[915,928] [2025-03-03 23:09:44,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:09:44,496 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:09:44,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-48.i[915,928] [2025-03-03 23:09:44,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:09:44,534 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:09:44,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:44 WrapperNode [2025-03-03 23:09:44,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:09:44,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:09:44,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:09:44,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:09:44,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:44" (1/1) ... [2025-03-03 23:09:44,545 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:44" (1/1) ... [2025-03-03 23:09:44,561 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2025-03-03 23:09:44,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:09:44,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:09:44,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:09:44,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:09:44,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:44" (1/1) ... [2025-03-03 23:09:44,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:44" (1/1) ... [2025-03-03 23:09:44,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:44" (1/1) ... [2025-03-03 23:09:44,578 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 23:09:44,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:44" (1/1) ... [2025-03-03 23:09:44,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:44" (1/1) ... [2025-03-03 23:09:44,583 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:44" (1/1) ... [2025-03-03 23:09:44,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:44" (1/1) ... [2025-03-03 23:09:44,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:44" (1/1) ... [2025-03-03 23:09:44,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:44" (1/1) ... [2025-03-03 23:09:44,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:09:44,591 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:09:44,591 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:09:44,591 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:09:44,592 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:44" (1/1) ... [2025-03-03 23:09:44,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:09:44,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:09:44,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:09:44,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:09:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:09:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:09:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:09:44,640 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:09:44,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:09:44,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:09:44,704 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:09:44,706 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:09:47,675 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 23:09:47,675 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:09:47,682 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:09:47,682 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:09:47,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:09:47 BoogieIcfgContainer [2025-03-03 23:09:47,682 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:09:47,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:09:47,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:09:47,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:09:47,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:09:44" (1/3) ... [2025-03-03 23:09:47,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7120af14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:09:47, skipping insertion in model container [2025-03-03 23:09:47,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:09:44" (2/3) ... [2025-03-03 23:09:47,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7120af14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:09:47, skipping insertion in model container [2025-03-03 23:09:47,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:09:47" (3/3) ... [2025-03-03 23:09:47,689 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-48.i [2025-03-03 23:09:47,698 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:09:47,700 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-48.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:09:47,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:09:47,746 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;@9daaa14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:09:47,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:09:47,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 23:09:47,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 23:09:47,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:09:47,756 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:09:47,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:09:47,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:09:47,759 INFO L85 PathProgramCache]: Analyzing trace with hash -711253515, now seen corresponding path program 1 times [2025-03-03 23:09:47,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:09:47,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051074990] [2025-03-03 23:09:47,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:47,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:09:47,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:09:47,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:09:47,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 23:09:47,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 23:09:48,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 23:09:48,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:48,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:09:48,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:09:48,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:09:48,084 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-03 23:09:48,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:09:48,084 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:09:48,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051074990] [2025-03-03 23:09:48,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051074990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:09:48,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:09:48,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:09:48,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665374658] [2025-03-03 23:09:48,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:09:48,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:09:48,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:09:48,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:09:48,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:09:48,101 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 36 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 23:09:48,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:09:48,115 INFO L93 Difference]: Finished difference Result 109 states and 177 transitions. [2025-03-03 23:09:48,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:09:48,116 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2025-03-03 23:09:48,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:09:48,119 INFO L225 Difference]: With dead ends: 109 [2025-03-03 23:09:48,120 INFO L226 Difference]: Without dead ends: 53 [2025-03-03 23:09:48,122 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-03 23:09:48,123 INFO L435 NwaCegarLoop]: 79 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, 79 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:09:48,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:09:48,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-03 23:09:48,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-03 23:09:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-03 23:09:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2025-03-03 23:09:48,157 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 116 [2025-03-03 23:09:48,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:09:48,157 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2025-03-03 23:09:48,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 23:09:48,157 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2025-03-03 23:09:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 23:09:48,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:09:48,161 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 23:09:48,172 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-03 23:09:48,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:09:48,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:09:48,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:09:48,364 INFO L85 PathProgramCache]: Analyzing trace with hash -999745665, now seen corresponding path program 1 times [2025-03-03 23:09:48,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:09:48,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007164316] [2025-03-03 23:09:48,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:09:48,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:09:48,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:09:48,368 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:09:48,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 23:09:48,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 23:09:48,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 23:09:48,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:09:48,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:09:48,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 23:09:48,716 INFO L279 TraceCheckSpWp]: Computing forward predicates...