./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.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 499c8c16001d132a6ca89f456fc83a3dce8695c53bb421baa12f3e220456e433 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:15:05,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:15:05,068 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:15:05,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:15:05,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:15:05,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:15:05,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:15:05,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:15:05,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:15:05,096 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:15:05,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:15:05,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:15:05,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:15:05,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:15:05,098 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:15:05,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:15:05,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:15:05,098 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:15:05,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:15:05,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:15:05,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:15:05,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:15:05,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:15:05,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:15:05,099 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:15:05,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:15:05,099 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:15:05,099 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:15:05,099 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:15:05,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:15:05,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:15:05,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:15:05,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:05,100 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:15:05,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:15:05,100 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:15:05,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:15:05,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:15:05,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:15:05,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:15:05,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:15:05,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:15:05,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:15:05,101 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 -> 499c8c16001d132a6ca89f456fc83a3dce8695c53bb421baa12f3e220456e433 [2025-03-03 23:15:05,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:15:05,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:15:05,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:15:05,359 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:15:05,359 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:15:05,360 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i [2025-03-03 23:15:06,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ff3a930/ca3aebed88eb49a4977dccf1e4ef099d/FLAG9581328c6 [2025-03-03 23:15:06,818 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:15:06,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i [2025-03-03 23:15:06,828 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ff3a930/ca3aebed88eb49a4977dccf1e4ef099d/FLAG9581328c6 [2025-03-03 23:15:06,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ff3a930/ca3aebed88eb49a4977dccf1e4ef099d [2025-03-03 23:15:06,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:15:06,847 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:15:06,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:06,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:15:06,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:15:06,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:06" (1/1) ... [2025-03-03 23:15:06,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e44cc30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:06, skipping insertion in model container [2025-03-03 23:15:06,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:06" (1/1) ... [2025-03-03 23:15:06,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:15:06,965 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i[915,928] [2025-03-03 23:15:07,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:07,015 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:15:07,025 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i[915,928] [2025-03-03 23:15:07,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:07,060 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:15:07,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:07 WrapperNode [2025-03-03 23:15:07,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:07,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:07,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:15:07,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:15:07,065 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:15:07" (1/1) ... [2025-03-03 23:15:07,071 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:15:07" (1/1) ... [2025-03-03 23:15:07,084 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2025-03-03 23:15:07,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:07,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:15:07,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:15:07,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:15:07,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:07" (1/1) ... [2025-03-03 23:15:07,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:07" (1/1) ... [2025-03-03 23:15:07,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:07" (1/1) ... [2025-03-03 23:15:07,103 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:15:07,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:07" (1/1) ... [2025-03-03 23:15:07,104 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:07" (1/1) ... [2025-03-03 23:15:07,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:07" (1/1) ... [2025-03-03 23:15:07,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:07" (1/1) ... [2025-03-03 23:15:07,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:07" (1/1) ... [2025-03-03 23:15:07,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:07" (1/1) ... [2025-03-03 23:15:07,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:15:07,116 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:15:07,116 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:15:07,116 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:15:07,117 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:07" (1/1) ... [2025-03-03 23:15:07,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:07,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:07,139 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:15:07,144 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:15:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:15:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:15:07,162 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:15:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:15:07,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:15:07,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:15:07,223 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:15:07,225 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:15:07,412 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~ite16#1;havoc property_#t~ite15#1;havoc property_#t~bitwise14#1;havoc property_#t~short17#1; [2025-03-03 23:15:07,429 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-03 23:15:07,429 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:15:07,438 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:15:07,439 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-03 23:15:07,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:07 BoogieIcfgContainer [2025-03-03 23:15:07,439 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:15:07,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:15:07,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:15:07,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:15:07,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:15:06" (1/3) ... [2025-03-03 23:15:07,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a57fb29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:07, skipping insertion in model container [2025-03-03 23:15:07,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:07" (2/3) ... [2025-03-03 23:15:07,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a57fb29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:07, skipping insertion in model container [2025-03-03 23:15:07,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:07" (3/3) ... [2025-03-03 23:15:07,447 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-90.i [2025-03-03 23:15:07,457 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:15:07,459 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-90.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:15:07,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:15:07,511 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;@585997b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:15:07,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:15:07,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 23:15:07,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 23:15:07,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:07,526 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:07,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:07,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:07,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1734727436, now seen corresponding path program 1 times [2025-03-03 23:15:07,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:07,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80331575] [2025-03-03 23:15:07,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:07,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:07,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:15:07,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:15:07,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:07,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-03 23:15:07,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:15:07,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80331575] [2025-03-03 23:15:07,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80331575] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:15:07,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411256561] [2025-03-03 23:15:07,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:07,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:15:07,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:07,740 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:15:07,741 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:15:07,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:15:07,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:15:07,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:07,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:07,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:15:07,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-03 23:15:07,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:15:07,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411256561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:07,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:15:07,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:15:07,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336617592] [2025-03-03 23:15:07,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:07,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:15:07,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:15:07,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:15:07,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:15:07,901 INFO L87 Difference]: Start difference. First operand has 61 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 23:15:07,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:07,920 INFO L93 Difference]: Finished difference Result 119 states and 192 transitions. [2025-03-03 23:15:07,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:15:07,921 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 109 [2025-03-03 23:15:07,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:07,926 INFO L225 Difference]: With dead ends: 119 [2025-03-03 23:15:07,926 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 23:15:07,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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:15:07,932 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:07,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:15:07,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 23:15:07,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-03 23:15:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 23:15:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2025-03-03 23:15:07,967 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 109 [2025-03-03 23:15:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:07,967 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2025-03-03 23:15:07,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 23:15:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2025-03-03 23:15:07,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 23:15:07,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:07,971 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:07,978 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:15:08,171 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:15:08,172 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:08,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:08,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1517957291, now seen corresponding path program 1 times [2025-03-03 23:15:08,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:08,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055520151] [2025-03-03 23:15:08,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:08,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:08,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:15:08,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:15:08,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:08,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-03 23:15:08,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:15:08,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055520151] [2025-03-03 23:15:08,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055520151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:08,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:15:08,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 23:15:08,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307512017] [2025-03-03 23:15:08,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:08,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:15:08,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:15:08,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:15:08,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:15:08,832 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-03 23:15:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:09,137 INFO L93 Difference]: Finished difference Result 199 states and 292 transitions. [2025-03-03 23:15:09,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 23:15:09,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2025-03-03 23:15:09,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:09,139 INFO L225 Difference]: With dead ends: 199 [2025-03-03 23:15:09,139 INFO L226 Difference]: Without dead ends: 144 [2025-03-03 23:15:09,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 23:15:09,140 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 122 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:09,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 604 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:15:09,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-03 23:15:09,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 67. [2025-03-03 23:15:09,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 23:15:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 97 transitions. [2025-03-03 23:15:09,155 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 97 transitions. Word has length 109 [2025-03-03 23:15:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:09,159 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 97 transitions. [2025-03-03 23:15:09,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-03 23:15:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2025-03-03 23:15:09,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 23:15:09,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:09,161 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:09,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 23:15:09,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:09,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:09,161 INFO L85 PathProgramCache]: Analyzing trace with hash -486010677, now seen corresponding path program 1 times [2025-03-03 23:15:09,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:09,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11143799] [2025-03-03 23:15:09,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:09,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:09,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:15:09,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:15:09,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:09,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-03 23:15:09,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:15:09,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11143799] [2025-03-03 23:15:09,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11143799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:09,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:15:09,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 23:15:09,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825059934] [2025-03-03 23:15:09,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:09,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 23:15:09,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:15:09,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 23:15:09,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:15:09,404 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-03 23:15:09,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:09,479 INFO L93 Difference]: Finished difference Result 176 states and 255 transitions. [2025-03-03 23:15:09,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 23:15:09,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2025-03-03 23:15:09,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:09,481 INFO L225 Difference]: With dead ends: 176 [2025-03-03 23:15:09,482 INFO L226 Difference]: Without dead ends: 112 [2025-03-03 23:15:09,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:15:09,484 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 73 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:09,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 658 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:15:09,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-03 23:15:09,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 59. [2025-03-03 23:15:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 23:15:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 83 transitions. [2025-03-03 23:15:09,496 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 83 transitions. Word has length 109 [2025-03-03 23:15:09,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:09,498 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 83 transitions. [2025-03-03 23:15:09,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-03 23:15:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 83 transitions. [2025-03-03 23:15:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 23:15:09,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:09,501 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:09,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 23:15:09,501 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:09,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:09,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2129290015, now seen corresponding path program 1 times [2025-03-03 23:15:09,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:15:09,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588322066] [2025-03-03 23:15:09,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:09,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:15:09,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 23:15:09,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 23:15:09,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:09,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:15:09,596 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:15:09,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 23:15:09,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 23:15:09,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:09,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:15:09,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:15:09,692 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:15:09,693 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:15:09,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 23:15:09,699 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 23:15:09,780 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:15:09,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:15:09 BoogieIcfgContainer [2025-03-03 23:15:09,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:15:09,784 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:15:09,785 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:15:09,785 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:15:09,785 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:07" (3/4) ... [2025-03-03 23:15:09,787 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:15:09,787 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:15:09,788 INFO L158 Benchmark]: Toolchain (without parser) took 2941.11ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 82.5MB in the end (delta: 50.2MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. [2025-03-03 23:15:09,789 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:09,789 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.99ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 120.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:15:09,789 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.79ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 118.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:15:09,790 INFO L158 Benchmark]: Boogie Preprocessor took 24.18ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 116.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:15:09,790 INFO L158 Benchmark]: IcfgBuilder took 323.33ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 98.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:15:09,790 INFO L158 Benchmark]: TraceAbstraction took 2342.17ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 82.5MB in the end (delta: 15.9MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2025-03-03 23:15:09,790 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 167.8MB. Free memory was 82.5MB in the beginning and 82.5MB in the end (delta: 50.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:15:09,792 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.18ms. Allocated memory is still 201.3MB. Free memory is still 128.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 212.99ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 120.2MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.79ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 118.4MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.18ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 116.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 323.33ms. Allocated memory is still 167.8MB. Free memory was 116.6MB in the beginning and 98.9MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2342.17ms. Allocated memory is still 167.8MB. Free memory was 98.4MB in the beginning and 82.5MB in the end (delta: 15.9MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 167.8MB. Free memory was 82.5MB in the beginning and 82.5MB in the end (delta: 50.8kB). Peak memory consumption was 8.4MB. 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 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 25; [L23] unsigned long int var_1_6 = 2; [L24] unsigned long int var_1_7 = 2762957886; [L25] unsigned long int var_1_8 = 2; [L26] unsigned long int var_1_9 = 1000000000; [L27] unsigned long int var_1_10 = 100; [L28] signed char var_1_11 = 4; [L29] signed char var_1_12 = 8; [L30] signed char var_1_13 = 10; [L31] signed char var_1_14 = 8; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] double var_1_17 = 32.4; [L35] double var_1_18 = 15.5; [L36] unsigned long int last_1_var_1_6 = 2; VAL [isInitial=0, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2762957886, var_1_8=2, var_1_9=1000000000] [L101] isInitial = 1 [L102] FCALL initially() [L103] int k_loop; [L104] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2762957886, var_1_8=2, var_1_9=1000000000] [L104] COND TRUE k_loop < 1 [L105] CALL updateLastVariables() [L94] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2762957886, var_1_8=2, var_1_9=1000000000] [L105] RET updateLastVariables() [L106] CALL updateVariables() [L66] var_1_7 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=2, var_1_9=1000000000] [L67] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=2, var_1_9=1000000000] [L68] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=2, var_1_9=1000000000] [L68] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=2, var_1_9=1000000000] [L69] var_1_8 = __VERIFIER_nondet_ulong() [L70] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_9=1000000000] [L70] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_9=1000000000] [L71] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649, var_1_9=1000000000] [L71] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649, var_1_9=1000000000] [L72] var_1_9 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L73] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L74] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L74] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L75] var_1_10 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L76] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L77] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L77] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L78] var_1_12 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L79] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L80] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L80] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L81] var_1_13 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L82] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L83] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L83] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L84] var_1_14 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L85] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L86] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L86] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L87] var_1_16 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L88] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L89] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L89] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L90] var_1_18 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L91] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L106] RET updateVariables() [L107] CALL step() [L40] var_1_15 = var_1_16 [L41] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=4, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967301, var_1_18=4294967301, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L42] COND TRUE \read(var_1_15) [L43] var_1_11 = (((var_1_12 + var_1_13) + var_1_14) - 50) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=2, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967301, var_1_18=4294967301, var_1_1=25, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L45] COND TRUE \read(var_1_15) [L46] var_1_1 = (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=2, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967301, var_1_18=4294967301, var_1_1=2, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L48] signed long int stepLocal_2 = (((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)); [L49] signed long int stepLocal_1 = (((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11)); [L50] unsigned long int stepLocal_0 = var_1_7 - var_1_8; VAL [isInitial=1, last_1_var_1_6=2, stepLocal_0=4294967296, stepLocal_1=2, stepLocal_2=2, var_1_10=0, var_1_11=2, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967301, var_1_18=4294967301, var_1_1=2, var_1_6=2, var_1_7=2147483647, var_1_8=-2147483649] [L51] COND FALSE !(last_1_var_1_6 != stepLocal_2) [L62] var_1_6 = var_1_8 VAL [isInitial=1, last_1_var_1_6=2, stepLocal_0=4294967296, stepLocal_1=2, var_1_10=0, var_1_11=2, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967301, var_1_18=4294967301, var_1_1=2, var_1_6=-2147483649, var_1_7=2147483647, var_1_8=-2147483649] [L107] RET step() [L108] CALL, EXPR property() [L97] EXPR (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=2, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967301, var_1_18=4294967301, var_1_1=2, var_1_6=-2147483649, var_1_7=2147483647, var_1_8=-2147483649] [L97] EXPR (last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=2, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967301, var_1_18=4294967301, var_1_1=2, var_1_6=-2147483649, var_1_7=2147483647, var_1_8=-2147483649] [L97] EXPR (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=2, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967301, var_1_18=4294967301, var_1_1=2, var_1_6=-2147483649, var_1_7=2147483647, var_1_8=-2147483649] [L97-L98] return ((((var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)))) && (var_1_15 ? (var_1_11 == ((signed char) (((var_1_12 + var_1_13) + var_1_14) - 50))) : 1)) && (var_1_15 == ((unsigned char) var_1_16))) && (var_1_17 == ((double) var_1_18)) ; [L108] RET, EXPR property() [L108] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=2, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967301, var_1_18=4294967301, var_1_1=2, var_1_6=-2147483649, var_1_7=2147483647, var_1_8=-2147483649] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=2, var_1_10=0, var_1_11=2, var_1_12=21, var_1_13=31, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=4294967301, var_1_18=4294967301, var_1_1=2, var_1_6=-2147483649, var_1_7=2147483647, var_1_8=-2147483649] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 1347 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 983 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 173 IncrementalHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 364 mSDtfsCounter, 173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 130 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 547 NumberOfCodeBlocks, 547 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 432 ConstructedInterpolants, 0 QuantifiedInterpolants, 699 SizeOfPredicates, 0 NumberOfNonLiveVariables, 260 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2144/2176 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:15:09,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.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 499c8c16001d132a6ca89f456fc83a3dce8695c53bb421baa12f3e220456e433 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:15:11,634 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:15:11,715 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:15:11,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:15:11,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:15:11,735 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:15:11,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:15:11,736 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:15:11,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:15:11,736 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:15:11,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:15:11,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:15:11,737 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:15:11,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:15:11,737 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:15:11,737 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:15:11,737 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:15:11,737 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:15:11,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:15:11,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:15:11,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:15:11,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:15:11,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:15:11,738 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:15:11,738 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:15:11,738 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:15:11,738 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:15:11,738 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:15:11,738 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:15:11,738 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:15:11,739 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:15:11,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:15:11,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:15:11,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:15:11,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:11,739 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:15:11,739 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:15:11,739 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:15:11,739 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:15:11,739 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:15:11,740 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:15:11,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:15:11,740 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:15:11,740 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:15:11,740 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:15:11,740 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 -> 499c8c16001d132a6ca89f456fc83a3dce8695c53bb421baa12f3e220456e433 [2025-03-03 23:15:11,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:15:11,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:15:11,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:15:11,990 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:15:11,990 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:15:11,991 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i [2025-03-03 23:15:13,202 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b178c90/f79132e56cea4da7a77dab683387b1fc/FLAGe1a1f95a4 [2025-03-03 23:15:13,383 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:15:13,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i [2025-03-03 23:15:13,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b178c90/f79132e56cea4da7a77dab683387b1fc/FLAGe1a1f95a4 [2025-03-03 23:15:13,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b178c90/f79132e56cea4da7a77dab683387b1fc [2025-03-03 23:15:13,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:15:13,410 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:15:13,412 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:13,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:15:13,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:15:13,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:13" (1/1) ... [2025-03-03 23:15:13,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@100b8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:13, skipping insertion in model container [2025-03-03 23:15:13,417 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:15:13" (1/1) ... [2025-03-03 23:15:13,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:15:13,538 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i[915,928] [2025-03-03 23:15:13,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:13,595 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:15:13,604 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-90.i[915,928] [2025-03-03 23:15:13,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:15:13,647 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:15:13,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:13 WrapperNode [2025-03-03 23:15:13,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:15:13,650 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:13,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:15:13,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:15:13,656 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:15:13" (1/1) ... [2025-03-03 23:15:13,666 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:15:13" (1/1) ... [2025-03-03 23:15:13,682 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2025-03-03 23:15:13,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:15:13,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:15:13,683 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:15:13,683 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:15:13,689 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:13" (1/1) ... [2025-03-03 23:15:13,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:13" (1/1) ... [2025-03-03 23:15:13,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:13" (1/1) ... [2025-03-03 23:15:13,700 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:15:13,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:13" (1/1) ... [2025-03-03 23:15:13,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:13" (1/1) ... [2025-03-03 23:15:13,707 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:13" (1/1) ... [2025-03-03 23:15:13,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:13" (1/1) ... [2025-03-03 23:15:13,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:13" (1/1) ... [2025-03-03 23:15:13,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:13" (1/1) ... [2025-03-03 23:15:13,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:15:13,712 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:15:13,712 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:15:13,712 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:15:13,715 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:13" (1/1) ... [2025-03-03 23:15:13,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:15:13,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:15:13,748 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:15:13,758 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:15:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:15:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:15:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:15:13,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:15:13,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:15:13,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:15:13,849 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:15:13,851 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:15:14,072 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-03-03 23:15:14,072 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:15:14,079 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:15:14,080 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:15:14,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:14 BoogieIcfgContainer [2025-03-03 23:15:14,081 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:15:14,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:15:14,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:15:14,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:15:14,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:15:13" (1/3) ... [2025-03-03 23:15:14,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238cec14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:14, skipping insertion in model container [2025-03-03 23:15:14,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:15:13" (2/3) ... [2025-03-03 23:15:14,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238cec14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:15:14, skipping insertion in model container [2025-03-03 23:15:14,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:15:14" (3/3) ... [2025-03-03 23:15:14,089 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-90.i [2025-03-03 23:15:14,099 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:15:14,100 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-90.i that has 2 procedures, 50 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:15:14,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:15:14,145 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;@1b530c1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:15:14,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:15:14,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 23:15:14,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 23:15:14,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:14,159 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:14,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:14,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:14,165 INFO L85 PathProgramCache]: Analyzing trace with hash -135991877, now seen corresponding path program 1 times [2025-03-03 23:15:14,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:15:14,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156195118] [2025-03-03 23:15:14,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:14,174 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:15:14,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:15:14,177 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:15:14,178 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:15:14,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 23:15:14,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 23:15:14,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:14,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:14,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:15:14,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-03 23:15:14,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:15:14,354 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:15:14,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156195118] [2025-03-03 23:15:14,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156195118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:15:14,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:15:14,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:15:14,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509114206] [2025-03-03 23:15:14,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:14,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:15:14,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:15:14,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:15:14,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:15:14,375 INFO L87 Difference]: Start difference. First operand has 50 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 23:15:14,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:14,390 INFO L93 Difference]: Finished difference Result 97 states and 160 transitions. [2025-03-03 23:15:14,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:15:14,391 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2025-03-03 23:15:14,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:14,396 INFO L225 Difference]: With dead ends: 97 [2025-03-03 23:15:14,396 INFO L226 Difference]: Without dead ends: 47 [2025-03-03 23:15:14,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:15:14,400 INFO L435 NwaCegarLoop]: 71 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, 71 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:15:14,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:15:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-03 23:15:14,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-03-03 23:15:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 23:15:14,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2025-03-03 23:15:14,441 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 107 [2025-03-03 23:15:14,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:14,441 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2025-03-03 23:15:14,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 23:15:14,442 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2025-03-03 23:15:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 23:15:14,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:14,445 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:14,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 23:15:14,647 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:15:14,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:14,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:14,649 INFO L85 PathProgramCache]: Analyzing trace with hash 221324058, now seen corresponding path program 1 times [2025-03-03 23:15:14,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:15:14,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305715848] [2025-03-03 23:15:14,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:14,649 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:15:14,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:15:14,651 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:15:14,653 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:15:14,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 23:15:14,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 23:15:14,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:14,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:14,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-03 23:15:14,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 382 proven. 36 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-03 23:15:18,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:15:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-03 23:15:25,653 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:15:25,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305715848] [2025-03-03 23:15:25,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305715848] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 23:15:25,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:15:25,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [31] total 42 [2025-03-03 23:15:25,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504496261] [2025-03-03 23:15:25,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:25,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 23:15:25,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:15:25,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 23:15:25,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1438, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 23:15:25,656 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-03 23:15:27,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:27,682 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2025-03-03 23:15:27,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 23:15:27,683 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2025-03-03 23:15:27,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:27,685 INFO L225 Difference]: With dead ends: 85 [2025-03-03 23:15:27,685 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 23:15:27,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=351, Invalid=1811, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 23:15:27,686 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 180 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:27,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 293 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 23:15:27,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 23:15:27,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2025-03-03 23:15:27,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.186046511627907) internal successors, (51), 44 states have internal predecessors, (51), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 23:15:27,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2025-03-03 23:15:27,699 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 107 [2025-03-03 23:15:27,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:27,699 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2025-03-03 23:15:27,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-03 23:15:27,700 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2025-03-03 23:15:27,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 23:15:27,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:27,701 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:27,705 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:15:27,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 23:15:27,905 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:27,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:27,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1964134393, now seen corresponding path program 1 times [2025-03-03 23:15:27,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:15:27,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130430027] [2025-03-03 23:15:27,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:27,906 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:15:27,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:15:27,908 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 23:15:27,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 23:15:27,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 23:15:27,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 23:15:27,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:27,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:27,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 23:15:27,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 160 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-03 23:15:28,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:15:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-03 23:15:28,170 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:15:28,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130430027] [2025-03-03 23:15:28,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130430027] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:15:28,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:15:28,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2025-03-03 23:15:28,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279211062] [2025-03-03 23:15:28,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:15:28,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 23:15:28,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:15:28,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 23:15:28,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 23:15:28,172 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 23:15:28,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:28,516 INFO L93 Difference]: Finished difference Result 173 states and 243 transitions. [2025-03-03 23:15:28,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 23:15:28,520 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 107 [2025-03-03 23:15:28,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:28,522 INFO L225 Difference]: With dead ends: 173 [2025-03-03 23:15:28,522 INFO L226 Difference]: Without dead ends: 105 [2025-03-03 23:15:28,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2025-03-03 23:15:28,523 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:28,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 214 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 23:15:28,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-03 23:15:28,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2025-03-03 23:15:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 56 states have internal predecessors, (58), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 23:15:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2025-03-03 23:15:28,543 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 107 [2025-03-03 23:15:28,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:28,544 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2025-03-03 23:15:28,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 23:15:28,544 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2025-03-03 23:15:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 23:15:28,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:28,545 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:28,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-03 23:15:28,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:15:28,746 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:28,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:28,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1697427539, now seen corresponding path program 1 times [2025-03-03 23:15:28,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:15:28,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320635566] [2025-03-03 23:15:28,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:28,747 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:15:28,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:15:28,750 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:15:28,751 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:15:28,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 23:15:28,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 23:15:28,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:28,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:28,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-03 23:15:28,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 426 proven. 78 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 23:15:33,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:15:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-03 23:15:41,309 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:15:41,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320635566] [2025-03-03 23:15:41,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320635566] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 23:15:41,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:15:41,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [37] total 49 [2025-03-03 23:15:41,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280032285] [2025-03-03 23:15:41,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:41,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 23:15:41,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:15:41,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 23:15:41,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=1952, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 23:15:41,312 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-03 23:15:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:42,862 INFO L93 Difference]: Finished difference Result 111 states and 149 transitions. [2025-03-03 23:15:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 23:15:42,864 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2025-03-03 23:15:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:42,865 INFO L225 Difference]: With dead ends: 111 [2025-03-03 23:15:42,865 INFO L226 Difference]: Without dead ends: 109 [2025-03-03 23:15:42,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=440, Invalid=2316, Unknown=0, NotChecked=0, Total=2756 [2025-03-03 23:15:42,867 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:42,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 215 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 23:15:42,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-03 23:15:42,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2025-03-03 23:15:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 59 states have internal predecessors, (61), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 23:15:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 139 transitions. [2025-03-03 23:15:42,884 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 139 transitions. Word has length 108 [2025-03-03 23:15:42,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:42,884 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 139 transitions. [2025-03-03 23:15:42,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-03 23:15:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 139 transitions. [2025-03-03 23:15:42,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 23:15:42,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:42,885 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:42,891 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:15:43,086 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 [2025-03-03 23:15:43,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:43,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:43,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1051031944, now seen corresponding path program 1 times [2025-03-03 23:15:43,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:15:43,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247922652] [2025-03-03 23:15:43,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:43,087 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:15:43,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:15:43,089 INFO L229 MonitoredProcess]: Starting monitored process 6 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:15:43,090 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 (6)] Waiting until timeout for monitored process [2025-03-03 23:15:43,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:15:43,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:15:43,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:43,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:43,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 23:15:43,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:15:46,603 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 441 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 23:15:46,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:15:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-03 23:15:53,663 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:15:53,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247922652] [2025-03-03 23:15:53,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247922652] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 23:15:53,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:15:53,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [35] total 48 [2025-03-03 23:15:53,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528696028] [2025-03-03 23:15:53,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:15:53,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 23:15:53,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:15:53,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 23:15:53,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1895, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 23:15:53,665 INFO L87 Difference]: Start difference. First operand 101 states and 139 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-03 23:15:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:15:57,390 INFO L93 Difference]: Finished difference Result 126 states and 161 transitions. [2025-03-03 23:15:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 23:15:57,391 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2025-03-03 23:15:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:15:57,392 INFO L225 Difference]: With dead ends: 126 [2025-03-03 23:15:57,392 INFO L226 Difference]: Without dead ends: 124 [2025-03-03 23:15:57,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=446, Invalid=2416, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 23:15:57,394 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 54 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 23:15:57,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 196 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 23:15:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-03 23:15:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 113. [2025-03-03 23:15:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 68 states have internal predecessors, (70), 39 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 23:15:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 148 transitions. [2025-03-03 23:15:57,421 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 148 transitions. Word has length 109 [2025-03-03 23:15:57,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:15:57,422 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 148 transitions. [2025-03-03 23:15:57,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-03 23:15:57,422 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 148 transitions. [2025-03-03 23:15:57,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 23:15:57,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:15:57,426 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:57,431 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 (6)] Ended with exit code 0 [2025-03-03 23:15:57,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:15:57,627 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:15:57,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:15:57,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1050108423, now seen corresponding path program 1 times [2025-03-03 23:15:57,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:15:57,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019999325] [2025-03-03 23:15:57,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:15:57,629 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:15:57,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:15:57,631 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:15:57,633 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:15:57,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 23:15:57,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 23:15:57,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:15:57,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:15:57,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-03 23:15:57,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:16:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 441 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-03 23:16:02,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:16:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2025-03-03 23:16:15,298 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:16:15,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019999325] [2025-03-03 23:16:15,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019999325] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 23:16:15,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:16:15,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [34] total 46 [2025-03-03 23:16:15,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046050407] [2025-03-03 23:16:15,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:16:15,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 23:16:15,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:16:15,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 23:16:15,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1709, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 23:16:15,299 INFO L87 Difference]: Start difference. First operand 113 states and 148 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-03 23:16:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:16:21,090 INFO L93 Difference]: Finished difference Result 125 states and 158 transitions. [2025-03-03 23:16:21,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 23:16:21,091 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2025-03-03 23:16:21,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:16:21,092 INFO L225 Difference]: With dead ends: 125 [2025-03-03 23:16:21,092 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 23:16:21,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=381, Invalid=1875, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 23:16:21,094 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 137 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-03 23:16:21,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 254 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-03 23:16:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 23:16:21,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 23:16:21,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 23:16:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 23:16:21,094 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2025-03-03 23:16:21,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:16:21,094 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 23:16:21,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-03 23:16:21,095 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 23:16:21,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 23:16:21,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:16:21,102 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 (7)] Ended with exit code 0 [2025-03-03 23:16:21,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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:16:21,300 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 23:16:21,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 23:16:35,704 WARN L286 SmtUtils]: Spent 13.97s on a formula simplification. DAG size of input: 453 DAG size of output: 14 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter)