./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.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 13cde4b32ba56cbf3417fbd3d3edc8641f523883922a409d107d73798b0beac0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:35:38,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:35:38,601 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:35:38,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:35:38,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:35:38,630 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:35:38,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:35:38,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:35:38,631 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:35:38,631 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:35:38,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:35:38,632 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:35:38,632 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:35:38,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:35:38,633 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:35:38,633 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:35:38,633 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:35:38,633 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:35:38,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:35:38,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:35:38,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:35:38,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:35:38,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:35:38,634 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:35:38,634 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:35:38,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:35:38,634 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:35:38,634 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:35:38,634 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:35:38,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:35:38,634 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:35:38,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:35:38,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:35:38,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:35:38,635 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:35:38,635 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:35:38,635 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:35:38,635 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:35:38,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:35:38,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:35:38,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:35:38,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:35:38,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:35:38,635 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 -> 13cde4b32ba56cbf3417fbd3d3edc8641f523883922a409d107d73798b0beac0 [2025-03-03 23:35:38,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:35:38,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:35:38,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:35:38,869 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:35:38,869 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:35:38,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i [2025-03-03 23:35:39,980 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec182e00/cb292a8bfb394d43a7a0ef175d7069cd/FLAG1a5e87966 [2025-03-03 23:35:40,227 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:35:40,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i [2025-03-03 23:35:40,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec182e00/cb292a8bfb394d43a7a0ef175d7069cd/FLAG1a5e87966 [2025-03-03 23:35:40,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aec182e00/cb292a8bfb394d43a7a0ef175d7069cd [2025-03-03 23:35:40,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:35:40,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:35:40,562 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:35:40,562 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:35:40,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:35:40,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:35:40" (1/1) ... [2025-03-03 23:35:40,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4863e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:40, skipping insertion in model container [2025-03-03 23:35:40,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:35:40" (1/1) ... [2025-03-03 23:35:40,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:35:40,671 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i[915,928] [2025-03-03 23:35:40,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:35:40,725 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:35:40,737 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i[915,928] [2025-03-03 23:35:40,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:35:40,786 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:35:40,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:40 WrapperNode [2025-03-03 23:35:40,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:35:40,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:35:40,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:35:40,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:35:40,793 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:35:40" (1/1) ... [2025-03-03 23:35:40,800 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:35:40" (1/1) ... [2025-03-03 23:35:40,824 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-03-03 23:35:40,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:35:40,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:35:40,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:35:40,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:35:40,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:40" (1/1) ... [2025-03-03 23:35:40,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:40" (1/1) ... [2025-03-03 23:35:40,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:40" (1/1) ... [2025-03-03 23:35:40,863 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:35:40,863 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:40" (1/1) ... [2025-03-03 23:35:40,863 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:40" (1/1) ... [2025-03-03 23:35:40,868 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:40" (1/1) ... [2025-03-03 23:35:40,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:40" (1/1) ... [2025-03-03 23:35:40,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:40" (1/1) ... [2025-03-03 23:35:40,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:40" (1/1) ... [2025-03-03 23:35:40,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:35:40,873 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:35:40,873 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:35:40,873 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:35:40,873 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:40" (1/1) ... [2025-03-03 23:35:40,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:35:40,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:35:40,896 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:35:40,898 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:35:40,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:35:40,913 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:35:40,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:35:40,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:35:40,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:35:40,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:35:40,964 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:35:40,966 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:35:41,198 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 23:35:41,198 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:35:41,207 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:35:41,207 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:35:41,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:35:41 BoogieIcfgContainer [2025-03-03 23:35:41,208 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:35:41,209 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:35:41,209 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:35:41,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:35:41,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:35:40" (1/3) ... [2025-03-03 23:35:41,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82559c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:35:41, skipping insertion in model container [2025-03-03 23:35:41,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:40" (2/3) ... [2025-03-03 23:35:41,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@82559c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:35:41, skipping insertion in model container [2025-03-03 23:35:41,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:35:41" (3/3) ... [2025-03-03 23:35:41,214 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-70.i [2025-03-03 23:35:41,224 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:35:41,225 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-70.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:35:41,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:35:41,277 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;@3b5b2a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:35:41,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:35:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 23:35:41,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 23:35:41,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:35:41,295 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:41,300 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:35:41,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:35:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1464356069, now seen corresponding path program 1 times [2025-03-03 23:35:41,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:35:41,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699918323] [2025-03-03 23:35:41,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:35:41,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:35:41,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 23:35:41,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 23:35:41,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:35:41,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:35:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 23:35:41,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:35:41,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699918323] [2025-03-03 23:35:41,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699918323] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:35:41,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106300261] [2025-03-03 23:35:41,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:35:41,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:35:41,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:35:41,572 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:35:41,574 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:35:41,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 23:35:41,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 23:35:41,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:35:41,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:35:41,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:35:41,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:35:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-03 23:35:41,734 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:35:41,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106300261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:35:41,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:35:41,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:35:41,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604403096] [2025-03-03 23:35:41,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:35:41,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:35:41,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:35:41,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:35:41,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:35:41,761 INFO L87 Difference]: Start difference. First operand has 49 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 23:35:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:35:41,775 INFO L93 Difference]: Finished difference Result 95 states and 152 transitions. [2025-03-03 23:35:41,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:35:41,776 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2025-03-03 23:35:41,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:35:41,782 INFO L225 Difference]: With dead ends: 95 [2025-03-03 23:35:41,782 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 23:35:41,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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:35:41,786 INFO L435 NwaCegarLoop]: 68 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, 68 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:35:41,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:35:41,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 23:35:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 23:35:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 23:35:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2025-03-03 23:35:41,816 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 90 [2025-03-03 23:35:41,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:35:41,816 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2025-03-03 23:35:41,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 23:35:41,817 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2025-03-03 23:35:41,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 23:35:41,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:35:41,819 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:41,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:35:42,019 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:35:42,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:35:42,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:35:42,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1747564034, now seen corresponding path program 1 times [2025-03-03 23:35:42,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:35:42,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575023928] [2025-03-03 23:35:42,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:35:42,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:35:42,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 23:35:42,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 23:35:42,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:35:42,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:35:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 23:35:42,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:35:42,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575023928] [2025-03-03 23:35:42,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575023928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:35:42,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:35:42,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 23:35:42,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469526013] [2025-03-03 23:35:42,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:35:42,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:35:42,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:35:42,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:35:42,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:35:42,412 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 23:35:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:35:42,436 INFO L93 Difference]: Finished difference Result 132 states and 189 transitions. [2025-03-03 23:35:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:35:42,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2025-03-03 23:35:42,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:35:42,438 INFO L225 Difference]: With dead ends: 132 [2025-03-03 23:35:42,438 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 23:35:42,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 23:35:42,439 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 31 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:35:42,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:35:42,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 23:35:42,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2025-03-03 23:35:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 58 states have internal predecessors, (73), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 23:35:42,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2025-03-03 23:35:42,474 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 90 [2025-03-03 23:35:42,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:35:42,475 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2025-03-03 23:35:42,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 23:35:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2025-03-03 23:35:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 23:35:42,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:35:42,478 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:42,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:35:42,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:35:42,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:35:42,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1718934883, now seen corresponding path program 1 times [2025-03-03 23:35:42,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:35:42,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928958228] [2025-03-03 23:35:42,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:35:42,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:35:42,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 23:35:42,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 23:35:42,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:35:42,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:35:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-03 23:35:43,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:35:43,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928958228] [2025-03-03 23:35:43,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928958228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:35:43,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952990011] [2025-03-03 23:35:43,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:35:43,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:35:43,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:35:43,318 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:35:43,320 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:35:43,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 23:35:43,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 23:35:43,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:35:43,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:35:43,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 23:35:43,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:35:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 23:35:44,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:35:44,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952990011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:35:44,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:35:44,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 17 [2025-03-03 23:35:44,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161720169] [2025-03-03 23:35:44,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:35:44,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 23:35:44,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:35:44,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 23:35:44,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-03 23:35:44,174 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 23:35:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:35:44,755 INFO L93 Difference]: Finished difference Result 268 states and 380 transitions. [2025-03-03 23:35:44,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 23:35:44,756 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2025-03-03 23:35:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:35:44,758 INFO L225 Difference]: With dead ends: 268 [2025-03-03 23:35:44,760 INFO L226 Difference]: Without dead ends: 184 [2025-03-03 23:35:44,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2025-03-03 23:35:44,763 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 183 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:35:44,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 297 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 23:35:44,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-03 23:35:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 136. [2025-03-03 23:35:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 91 states have (on average 1.2527472527472527) internal successors, (114), 91 states have internal predecessors, (114), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 23:35:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 192 transitions. [2025-03-03 23:35:44,793 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 192 transitions. Word has length 90 [2025-03-03 23:35:44,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:35:44,794 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 192 transitions. [2025-03-03 23:35:44,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 23:35:44,795 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 192 transitions. [2025-03-03 23:35:44,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 23:35:44,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:35:44,797 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:44,803 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:35:45,001 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,SelfDestructingSolverStorable2 [2025-03-03 23:35:45,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:35:45,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:35:45,002 INFO L85 PathProgramCache]: Analyzing trace with hash -892257380, now seen corresponding path program 1 times [2025-03-03 23:35:45,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:35:45,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288903339] [2025-03-03 23:35:45,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:35:45,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:35:45,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 23:35:45,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 23:35:45,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:35:45,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:35:45,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [208130489] [2025-03-03 23:35:45,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:35:45,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:35:45,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:35:45,076 INFO L229 MonitoredProcess]: Starting monitored process 4 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:35:45,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 23:35:45,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 23:35:45,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 23:35:45,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:35:45,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:35:45,546 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:35:45,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 23:35:45,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 23:35:45,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:35:45,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:35:45,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:35:45,692 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:35:45,692 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:35:45,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 23:35:45,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:35:45,900 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 23:35:45,946 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:35:45,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:35:45 BoogieIcfgContainer [2025-03-03 23:35:45,950 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:35:45,950 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:35:45,951 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:35:45,951 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:35:45,951 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:35:41" (3/4) ... [2025-03-03 23:35:45,953 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:35:45,954 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:35:45,954 INFO L158 Benchmark]: Toolchain (without parser) took 5393.22ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 105.8MB in the beginning and 269.0MB in the end (delta: -163.3MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2025-03-03 23:35:45,955 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:35:45,955 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.41ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 92.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:35:45,957 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.10ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 88.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:35:45,957 INFO L158 Benchmark]: Boogie Preprocessor took 46.75ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 83.9MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:35:45,957 INFO L158 Benchmark]: IcfgBuilder took 334.99ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 64.4MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:35:45,957 INFO L158 Benchmark]: TraceAbstraction took 4740.61ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 63.5MB in the beginning and 269.1MB in the end (delta: -205.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:35:45,958 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 327.2MB. Free memory was 269.1MB in the beginning and 269.0MB in the end (delta: 101.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:35:45,958 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.91ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.41ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 92.3MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.10ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 88.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.75ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 83.9MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 334.99ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 64.4MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4740.61ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 63.5MB in the beginning and 269.1MB in the end (delta: -205.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 327.2MB. Free memory was 269.1MB in the beginning and 269.0MB in the end (delta: 101.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 109. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.05; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 49.5; [L25] double var_1_8 = 16.75; [L26] unsigned short int var_1_9 = 1; [L27] unsigned long int var_1_11 = 8; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_14 = 32; [L31] unsigned char var_1_15 = 50; [L32] unsigned char var_1_16 = 8; [L33] unsigned char var_1_17 = 32; [L34] unsigned long int var_1_18 = 2; [L35] unsigned long int var_1_19 = 3876014737; [L36] unsigned char var_1_20 = 0; [L37] double last_1_var_1_1 = 5.05; [L38] unsigned short int last_1_var_1_9 = 1; [L39] unsigned long int last_1_var_1_11 = 8; [L40] unsigned char last_1_var_1_14 = 32; [L41] unsigned char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L113] isInitial = 1 [L114] FCALL initially() [L115] int k_loop; [L116] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L116] COND TRUE k_loop < 1 [L117] CALL updateLastVariables() [L102] last_1_var_1_1 = var_1_1 [L103] last_1_var_1_9 = var_1_9 [L104] last_1_var_1_11 = var_1_11 [L105] last_1_var_1_14 = var_1_14 [L106] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_6=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L117] RET updateLastVariables() [L118] CALL updateVariables() [L79] var_1_6 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L80] RET assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L81] var_1_7 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_8=67/4, var_1_9=1] [L82] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_8=67/4, var_1_9=1] [L83] var_1_8 = __VERIFIER_nondet_double() [L84] 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_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L84] 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_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L85] var_1_13 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L86] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L87] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L87] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L88] var_1_15 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L89] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L90] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L90] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L91] var_1_16 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L92] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L93] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L93] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L94] var_1_17 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L95] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L96] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L96] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_9=1] [L97] var_1_19 = __VERIFIER_nondet_ulong() [L98] CALL assume_abort_if_not(var_1_19 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L98] RET assume_abort_if_not(var_1_19 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L99] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L99] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=2, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L118] RET updateVariables() [L119] CALL step() [L45] COND TRUE \read(var_1_13) [L46] var_1_18 = ((var_1_19 - last_1_var_1_9) - last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=3221225461, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L50] COND FALSE !(var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=3221225461, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L59] COND TRUE (8 - 64) <= (var_1_9 - var_1_9) [L60] var_1_14 = (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=3221225461, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L64] signed long int stepLocal_0 = - ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))); VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, stepLocal_0=-1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=3221225461, var_1_19=3221225470, var_1_1=101/20, var_1_20=0, var_1_9=1] [L65] COND FALSE !(var_1_18 >= stepLocal_0) [L68] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=0, var_1_7=2, var_1_9=1] [L70] COND TRUE (var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14))) [L71] var_1_20 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=1, var_1_7=2, var_1_9=1] [L73] COND TRUE \read(var_1_20) [L74] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=1, var_1_7=2, var_1_9=1] [L76] var_1_11 = (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=1, var_1_7=2, var_1_9=1] [L119] RET step() [L120] CALL, EXPR property() [L109-L110] return (((((((var_1_18 >= (- ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))) ? (var_1_1 == ((double) (((var_1_6 - var_1_7) - ((((64.75) > (128.725)) ? (64.75) : (128.725)))) + var_1_8))) : (var_1_1 == ((double) var_1_7))) && ((var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) ? ((! ((last_1_var_1_1 == var_1_7) && (last_1_var_1_20 || last_1_var_1_20))) ? ((! (var_1_6 <= var_1_7)) ? (var_1_9 == ((unsigned short int) ((((last_1_var_1_14) < (last_1_var_1_14)) ? (last_1_var_1_14) : (last_1_var_1_14))))) : 1) : (var_1_9 == ((unsigned short int) last_1_var_1_14))) : 1)) && (var_1_11 == ((unsigned long int) (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u))))) && (var_1_20 ? (var_1_12 == ((unsigned char) var_1_13)) : 1)) && (((8 - 64) <= (var_1_9 - var_1_9)) ? (var_1_14 == ((unsigned char) (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_17)))) && (var_1_13 ? (var_1_18 == ((unsigned long int) ((var_1_19 - last_1_var_1_9) - last_1_var_1_11))) : (var_1_18 == ((unsigned long int) (((((var_1_19 - var_1_17)) > (var_1_15)) ? ((var_1_19 - var_1_17)) : (var_1_15))))))) && (((var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) ? (var_1_20 == ((unsigned char) var_1_13)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=1, var_1_7=2, var_1_9=1] [L120] RET, EXPR property() [L120] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=1, var_1_7=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-256, var_1_18=3221225461, var_1_19=3221225470, var_1_1=2, var_1_20=1, var_1_7=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 4, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 214 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 214 mSDsluCounter, 484 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 271 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 344 IncrementalHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 213 mSDtfsCounter, 344 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=3, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 50 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 630 NumberOfCodeBlocks, 630 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 445 ConstructedInterpolants, 0 QuantifiedInterpolants, 1992 SizeOfPredicates, 6 NumberOfNonLiveVariables, 463 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1533/1560 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:35:45,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.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 13cde4b32ba56cbf3417fbd3d3edc8641f523883922a409d107d73798b0beac0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:35:47,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:35:47,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:35:47,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:35:47,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:35:47,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:35:47,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:35:47,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:35:47,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:35:47,876 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:35:47,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:35:47,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:35:47,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:35:47,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:35:47,878 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:35:47,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:35:47,878 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:35:47,878 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:35:47,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:35:47,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:35:47,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:35:47,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:35:47,879 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:35:47,879 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:35:47,879 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:35:47,879 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:35:47,879 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:35:47,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:35:47,879 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:35:47,880 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:35:47,880 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:35:47,880 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:35:47,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:35:47,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:35:47,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:35:47,880 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:35:47,880 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:35:47,880 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:35:47,880 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:35:47,880 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:35:47,880 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:35:47,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:35:47,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:35:47,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:35:47,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:35:47,880 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 -> 13cde4b32ba56cbf3417fbd3d3edc8641f523883922a409d107d73798b0beac0 [2025-03-03 23:35:48,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:35:48,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:35:48,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:35:48,096 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:35:48,097 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:35:48,097 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i [2025-03-03 23:35:49,263 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f540b0bc/d5dbf9da543042958b5f8578dba141fa/FLAGa49d46916 [2025-03-03 23:35:49,484 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:35:49,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i [2025-03-03 23:35:49,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f540b0bc/d5dbf9da543042958b5f8578dba141fa/FLAGa49d46916 [2025-03-03 23:35:49,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f540b0bc/d5dbf9da543042958b5f8578dba141fa [2025-03-03 23:35:49,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:35:49,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:35:49,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:35:49,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:35:49,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:35:49,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:35:49" (1/1) ... [2025-03-03 23:35:49,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61698d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:49, skipping insertion in model container [2025-03-03 23:35:49,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:35:49" (1/1) ... [2025-03-03 23:35:49,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:35:49,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i[915,928] [2025-03-03 23:35:49,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:35:49,710 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:35:49,719 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-70.i[915,928] [2025-03-03 23:35:49,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:35:49,751 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:35:49,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:49 WrapperNode [2025-03-03 23:35:49,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:35:49,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:35:49,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:35:49,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:35:49,757 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:35:49" (1/1) ... [2025-03-03 23:35:49,770 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:35:49" (1/1) ... [2025-03-03 23:35:49,793 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-03-03 23:35:49,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:35:49,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:35:49,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:35:49,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:35:49,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:49" (1/1) ... [2025-03-03 23:35:49,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:49" (1/1) ... [2025-03-03 23:35:49,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:49" (1/1) ... [2025-03-03 23:35:49,817 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:35:49,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:49" (1/1) ... [2025-03-03 23:35:49,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:49" (1/1) ... [2025-03-03 23:35:49,830 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:49" (1/1) ... [2025-03-03 23:35:49,834 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:49" (1/1) ... [2025-03-03 23:35:49,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:49" (1/1) ... [2025-03-03 23:35:49,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:49" (1/1) ... [2025-03-03 23:35:49,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:35:49,839 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:35:49,839 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:35:49,840 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:35:49,840 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:49" (1/1) ... [2025-03-03 23:35:49,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:35:49,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:35:49,874 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:35:49,877 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:35:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:35:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:35:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:35:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:35:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:35:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:35:49,955 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:35:49,957 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:35:54,743 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-03 23:35:54,743 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:35:54,750 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:35:54,750 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:35:54,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:35:54 BoogieIcfgContainer [2025-03-03 23:35:54,751 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:35:54,752 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:35:54,752 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:35:54,755 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:35:54,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:35:49" (1/3) ... [2025-03-03 23:35:54,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5639b385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:35:54, skipping insertion in model container [2025-03-03 23:35:54,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:35:49" (2/3) ... [2025-03-03 23:35:54,756 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5639b385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:35:54, skipping insertion in model container [2025-03-03 23:35:54,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:35:54" (3/3) ... [2025-03-03 23:35:54,757 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-70.i [2025-03-03 23:35:54,766 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:35:54,767 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-70.i that has 2 procedures, 49 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:35:54,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:35:54,808 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;@43d70152, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:35:54,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:35:54,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 23:35:54,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 23:35:54,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:35:54,821 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:54,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:35:54,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:35:54,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1464356069, now seen corresponding path program 1 times [2025-03-03 23:35:54,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:35:54,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845339713] [2025-03-03 23:35:54,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:35:54,835 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:35:54,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:35:54,837 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:35:54,839 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:35:54,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 23:35:55,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 23:35:55,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:35:55,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:35:55,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:35:55,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:35:55,159 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-03-03 23:35:55,160 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:35:55,161 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:35:55,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845339713] [2025-03-03 23:35:55,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845339713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:35:55,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:35:55,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:35:55,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729209712] [2025-03-03 23:35:55,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:35:55,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:35:55,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:35:55,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:35:55,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:35:55,184 INFO L87 Difference]: Start difference. First operand has 49 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 34 states have internal predecessors, (45), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 23:35:55,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:35:55,203 INFO L93 Difference]: Finished difference Result 95 states and 152 transitions. [2025-03-03 23:35:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:35:55,204 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2025-03-03 23:35:55,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:35:55,208 INFO L225 Difference]: With dead ends: 95 [2025-03-03 23:35:55,208 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 23:35:55,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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:35:55,212 INFO L435 NwaCegarLoop]: 68 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, 68 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:35:55,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:35:55,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 23:35:55,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 23:35:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 23:35:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2025-03-03 23:35:55,238 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 90 [2025-03-03 23:35:55,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:35:55,238 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2025-03-03 23:35:55,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 23:35:55,239 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2025-03-03 23:35:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 23:35:55,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:35:55,241 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:55,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 23:35:55,443 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:35:55,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:35:55,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:35:55,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1747564034, now seen corresponding path program 1 times [2025-03-03 23:35:55,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:35:55,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603606906] [2025-03-03 23:35:55,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:35:55,445 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:35:55,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:35:55,447 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:35:55,448 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:35:55,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 23:35:55,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 23:35:55,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:35:55,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:35:55,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 23:35:55,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:35:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 23:35:57,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:35:57,961 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:35:57,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603606906] [2025-03-03 23:35:57,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603606906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:35:57,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [16992055] [2025-03-03 23:35:57,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:35:57,962 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 23:35:57,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 23:35:57,983 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 23:35:57,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-03 23:35:58,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 23:35:58,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 23:35:58,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:35:58,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:35:58,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 23:35:58,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:35:58,684 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-03 23:35:58,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:35:58,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [16992055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:35:58,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:35:58,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2025-03-03 23:35:58,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087690541] [2025-03-03 23:35:58,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:35:58,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 23:35:58,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:35:58,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 23:35:58,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:35:58,688 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 23:36:01,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:36:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:36:01,084 INFO L93 Difference]: Finished difference Result 132 states and 189 transitions. [2025-03-03 23:36:01,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 23:36:01,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2025-03-03 23:36:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:36:01,086 INFO L225 Difference]: With dead ends: 132 [2025-03-03 23:36:01,087 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 23:36:01,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:36:01,088 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 15 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 23:36:01,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 23:36:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 23:36:01,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2025-03-03 23:36:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 58 states have internal predecessors, (73), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-03 23:36:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2025-03-03 23:36:01,101 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 90 [2025-03-03 23:36:01,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:36:01,101 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2025-03-03 23:36:01,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-03 23:36:01,101 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2025-03-03 23:36:01,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 23:36:01,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:36:01,105 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:01,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-03-03 23:36:01,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 23:36:01,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:36:01,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:36:01,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:36:01,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1718934883, now seen corresponding path program 1 times [2025-03-03 23:36:01,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:36:01,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296070112] [2025-03-03 23:36:01,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:36:01,507 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:36:01,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:36:01,509 INFO L229 MonitoredProcess]: Starting monitored process 5 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:36:01,510 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 (5)] Waiting until timeout for monitored process [2025-03-03 23:36:01,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 23:36:01,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 23:36:01,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:36:01,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:36:01,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 23:36:01,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:36:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 23:36:03,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:36:03,672 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:36:03,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296070112] [2025-03-03 23:36:03,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296070112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:36:03,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [433287403] [2025-03-03 23:36:03,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:36:03,673 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 23:36:03,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 23:36:03,675 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 23:36:03,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-03 23:36:03,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 23:36:04,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 23:36:04,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:36:04,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:36:04,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 23:36:04,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:36:05,188 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 78 proven. 3 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-03 23:36:05,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:36:05,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [433287403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:36:05,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:36:05,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-03-03 23:36:05,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977317738] [2025-03-03 23:36:05,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:36:05,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 23:36:05,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:36:05,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 23:36:05,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-03 23:36:05,265 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 23:36:08,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:36:12,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:36:12,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:36:12,818 INFO L93 Difference]: Finished difference Result 303 states and 431 transitions. [2025-03-03 23:36:12,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 23:36:12,819 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2025-03-03 23:36:12,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:36:12,821 INFO L225 Difference]: With dead ends: 303 [2025-03-03 23:36:12,821 INFO L226 Difference]: Without dead ends: 219 [2025-03-03 23:36:12,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2025-03-03 23:36:12,822 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 179 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:36:12,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 260 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2025-03-03 23:36:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-03 23:36:12,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 132. [2025-03-03 23:36:12,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.2613636363636365) internal successors, (111), 88 states have internal predecessors, (111), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 23:36:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 189 transitions. [2025-03-03 23:36:12,839 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 189 transitions. Word has length 90 [2025-03-03 23:36:12,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:36:12,839 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 189 transitions. [2025-03-03 23:36:12,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 23:36:12,841 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 189 transitions. [2025-03-03 23:36:12,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 23:36:12,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:36:12,842 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:12,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-03 23:36:13,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-03 23:36:13,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 23:36:13,243 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:36:13,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:36:13,244 INFO L85 PathProgramCache]: Analyzing trace with hash -892257380, now seen corresponding path program 1 times [2025-03-03 23:36:13,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:36:13,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341716849] [2025-03-03 23:36:13,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:36:13,244 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:36:13,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:36:13,247 INFO L229 MonitoredProcess]: Starting monitored process 7 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:36:13,252 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 (7)] Waiting until timeout for monitored process [2025-03-03 23:36:13,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 23:36:13,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 23:36:13,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:36:13,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:36:13,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 23:36:13,534 INFO L279 TraceCheckSpWp]: Computing forward predicates...