./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/reducercommutativity/rangesum10.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 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:21:53,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:21:53,975 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:21:53,978 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:21:53,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:21:53,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:21:53,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:21:53,993 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:21:53,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:21:53,993 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:21:53,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:21:53,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:21:53,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:21:53,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:21:53,994 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:21:53,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:21:53,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:21:53,994 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:21:53,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:21:53,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:21:53,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:21:53,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:21:53,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:21:53,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:21:53,995 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:21:53,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:21:53,995 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:21:53,995 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:21:53,995 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:21:53,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:21:53,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:21:53,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:21:53,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:21:53,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:21:53,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:21:53,995 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:21:53,995 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:21:53,995 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:21:53,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:21:53,995 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:21:53,995 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:21:53,995 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:21:53,996 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:21:53,996 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 -> 43671c88cb28f81a53d6c7fbea907e55b0f99c68f8a522c4103c0a12ddf9f652 [2025-03-08 00:21:54,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:21:54,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:21:54,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:21:54,219 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:21:54,219 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:21:54,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum10.i [2025-03-08 00:21:55,386 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1fc34a3/b7c0af8aafeb48e2b8c53174e3c69906/FLAG8d727f549 [2025-03-08 00:21:55,599 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:21:55,600 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum10.i [2025-03-08 00:21:55,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1fc34a3/b7c0af8aafeb48e2b8c53174e3c69906/FLAG8d727f549 [2025-03-08 00:21:55,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1fc34a3/b7c0af8aafeb48e2b8c53174e3c69906 [2025-03-08 00:21:55,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:21:55,956 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:21:55,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:21:55,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:21:55,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:21:55,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:21:55" (1/1) ... [2025-03-08 00:21:55,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77a64f0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:55, skipping insertion in model container [2025-03-08 00:21:55,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:21:55" (1/1) ... [2025-03-08 00:21:55,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:21:56,087 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/reducercommutativity/rangesum10.i[1465,1478] [2025-03-08 00:21:56,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:21:56,095 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:21:56,106 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/reducercommutativity/rangesum10.i[1465,1478] [2025-03-08 00:21:56,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:21:56,116 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:21:56,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:56 WrapperNode [2025-03-08 00:21:56,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:21:56,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:21:56,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:21:56,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:21:56,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:56" (1/1) ... [2025-03-08 00:21:56,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:56" (1/1) ... [2025-03-08 00:21:56,139 INFO L138 Inliner]: procedures = 17, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2025-03-08 00:21:56,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:21:56,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:21:56,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:21:56,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:21:56,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:56" (1/1) ... [2025-03-08 00:21:56,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:56" (1/1) ... [2025-03-08 00:21:56,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:56" (1/1) ... [2025-03-08 00:21:56,163 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-08 00:21:56,164 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:56" (1/1) ... [2025-03-08 00:21:56,164 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:56" (1/1) ... [2025-03-08 00:21:56,168 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:56" (1/1) ... [2025-03-08 00:21:56,171 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:56" (1/1) ... [2025-03-08 00:21:56,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:56" (1/1) ... [2025-03-08 00:21:56,176 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:56" (1/1) ... [2025-03-08 00:21:56,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:21:56,178 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:21:56,178 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:21:56,178 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:21:56,179 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:56" (1/1) ... [2025-03-08 00:21:56,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:21:56,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:21:56,204 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-08 00:21:56,209 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-08 00:21:56,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:21:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:21:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:21:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:21:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:21:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:21:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:21:56,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:21:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:21:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:21:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2025-03-08 00:21:56,223 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2025-03-08 00:21:56,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:21:56,279 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:21:56,281 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:21:56,402 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-03-08 00:21:56,444 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-08 00:21:56,444 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:21:56,451 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:21:56,451 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:21:56,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:21:56 BoogieIcfgContainer [2025-03-08 00:21:56,451 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:21:56,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:21:56,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:21:56,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:21:56,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:21:55" (1/3) ... [2025-03-08 00:21:56,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273762d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:21:56, skipping insertion in model container [2025-03-08 00:21:56,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:56" (2/3) ... [2025-03-08 00:21:56,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@273762d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:21:56, skipping insertion in model container [2025-03-08 00:21:56,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:21:56" (3/3) ... [2025-03-08 00:21:56,458 INFO L128 eAbstractionObserver]: Analyzing ICFG rangesum10.i [2025-03-08 00:21:56,469 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:21:56,470 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rangesum10.i that has 2 procedures, 25 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:21:56,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:21:56,523 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;@2f11b380, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:21:56,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:21:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:21:56,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 00:21:56,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:56,532 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:21:56,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:56,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:56,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1874150879, now seen corresponding path program 1 times [2025-03-08 00:21:56,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:56,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541260054] [2025-03-08 00:21:56,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:56,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:56,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 00:21:56,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:21:56,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:56,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:56,774 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:21:56,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:21:56,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541260054] [2025-03-08 00:21:56,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541260054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:21:56,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:21:56,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:21:56,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744470910] [2025-03-08 00:21:56,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:21:56,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:21:56,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:21:56,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:21:56,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:21:56,794 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:21:56,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:21:56,825 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2025-03-08 00:21:56,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:21:56,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-03-08 00:21:56,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:21:56,831 INFO L225 Difference]: With dead ends: 48 [2025-03-08 00:21:56,831 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 00:21:56,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:21:56,835 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:21:56,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:21:56,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 00:21:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-08 00:21:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:21:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-03-08 00:21:56,860 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 28 [2025-03-08 00:21:56,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:21:56,861 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-08 00:21:56,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:21:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-03-08 00:21:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:21:56,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:56,864 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:21:56,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:21:56,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:56,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:56,865 INFO L85 PathProgramCache]: Analyzing trace with hash 501005872, now seen corresponding path program 1 times [2025-03-08 00:21:56,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:56,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583564613] [2025-03-08 00:21:56,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:56,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:56,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 00:21:56,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:21:56,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:56,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 00:21:56,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:21:56,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583564613] [2025-03-08 00:21:56,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583564613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:21:56,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205005505] [2025-03-08 00:21:56,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:56,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:56,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:21:56,990 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-08 00:21:56,992 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-08 00:21:57,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 00:21:57,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:21:57,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:57,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:57,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:21:57,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:21:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:21:57,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:21:57,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205005505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:21:57,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:21:57,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:21:57,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61679687] [2025-03-08 00:21:57,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:21:57,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:21:57,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:21:57,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:21:57,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:21:57,112 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:21:57,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:21:57,133 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2025-03-08 00:21:57,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:21:57,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-03-08 00:21:57,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:21:57,134 INFO L225 Difference]: With dead ends: 41 [2025-03-08 00:21:57,134 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 00:21:57,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:21:57,135 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:21:57,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 45 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:21:57,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 00:21:57,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-03-08 00:21:57,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:21:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-03-08 00:21:57,142 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 29 [2025-03-08 00:21:57,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:21:57,142 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-03-08 00:21:57,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:21:57,144 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-03-08 00:21:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:21:57,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:57,145 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:21:57,151 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-08 00:21:57,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:57,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:57,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:57,346 INFO L85 PathProgramCache]: Analyzing trace with hash 823687979, now seen corresponding path program 1 times [2025-03-08 00:21:57,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:57,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363996269] [2025-03-08 00:21:57,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:57,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:57,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 00:21:57,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:21:57,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:57,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 00:21:57,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:21:57,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363996269] [2025-03-08 00:21:57,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363996269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:21:57,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304521683] [2025-03-08 00:21:57,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:57,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:57,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:21:57,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:21:57,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:21:57,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 00:21:57,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:21:57,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:57,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:57,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:21:57,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:21:57,548 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 00:21:57,550 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:21:57,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304521683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:21:57,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:21:57,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:21:57,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73632889] [2025-03-08 00:21:57,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:21:57,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:21:57,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:21:57,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:21:57,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:21:57,551 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:21:57,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:21:57,562 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-03-08 00:21:57,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:21:57,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2025-03-08 00:21:57,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:21:57,564 INFO L225 Difference]: With dead ends: 39 [2025-03-08 00:21:57,564 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 00:21:57,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:21:57,565 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:21:57,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:21:57,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 00:21:57,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 00:21:57,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:21:57,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2025-03-08 00:21:57,571 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 38 [2025-03-08 00:21:57,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:21:57,572 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2025-03-08 00:21:57,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:21:57,573 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2025-03-08 00:21:57,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:21:57,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:57,574 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:21:57,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:21:57,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 00:21:57,775 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:57,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:57,775 INFO L85 PathProgramCache]: Analyzing trace with hash 691853118, now seen corresponding path program 1 times [2025-03-08 00:21:57,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:57,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87336434] [2025-03-08 00:21:57,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:57,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:57,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 00:21:57,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:21:57,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:57,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 00:21:57,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:21:57,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87336434] [2025-03-08 00:21:57,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87336434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:21:57,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172300479] [2025-03-08 00:21:57,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:57,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:57,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:21:57,866 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:21:57,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:21:57,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 00:21:57,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:21:57,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:57,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:57,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:21:57,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:21:57,948 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-08 00:21:57,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:21:57,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172300479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:21:57,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:21:57,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:21:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771019912] [2025-03-08 00:21:57,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:21:57,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:21:57,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:21:57,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:21:57,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:21:57,949 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:21:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:21:57,961 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2025-03-08 00:21:57,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:21:57,961 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2025-03-08 00:21:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:21:57,962 INFO L225 Difference]: With dead ends: 48 [2025-03-08 00:21:57,962 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 00:21:57,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:21:57,962 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:21:57,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:21:57,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 00:21:57,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-08 00:21:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:21:57,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2025-03-08 00:21:57,970 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 39 [2025-03-08 00:21:57,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:21:57,970 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2025-03-08 00:21:57,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:21:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2025-03-08 00:21:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:21:57,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:57,971 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:21:57,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:21:58,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:58,175 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:58,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:58,176 INFO L85 PathProgramCache]: Analyzing trace with hash -531326629, now seen corresponding path program 1 times [2025-03-08 00:21:58,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:58,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975031547] [2025-03-08 00:21:58,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:58,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:58,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 00:21:58,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:21:58,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:58,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:58,226 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 00:21:58,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:21:58,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975031547] [2025-03-08 00:21:58,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975031547] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:21:58,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035331886] [2025-03-08 00:21:58,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:58,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:58,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:21:58,230 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:21:58,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:21:58,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 00:21:58,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:21:58,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:58,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:58,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:21:58,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:21:58,319 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 00:21:58,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:21:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 00:21:58,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035331886] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:21:58,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:21:58,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:21:58,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535289722] [2025-03-08 00:21:58,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:21:58,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:21:58,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:21:58,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:21:58,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:21:58,348 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:21:58,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:21:58,364 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2025-03-08 00:21:58,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:21:58,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2025-03-08 00:21:58,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:21:58,366 INFO L225 Difference]: With dead ends: 57 [2025-03-08 00:21:58,366 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 00:21:58,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:21:58,367 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:21:58,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:21:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 00:21:58,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-08 00:21:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:21:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-03-08 00:21:58,373 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 39 [2025-03-08 00:21:58,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:21:58,373 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-03-08 00:21:58,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:21:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-03-08 00:21:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 00:21:58,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:58,374 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:21:58,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 00:21:58,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:58,575 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:58,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:58,575 INFO L85 PathProgramCache]: Analyzing trace with hash 496520842, now seen corresponding path program 2 times [2025-03-08 00:21:58,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:58,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151232416] [2025-03-08 00:21:58,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:21:58,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:58,583 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-08 00:21:58,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 00:21:58,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:21:58,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:58,625 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 00:21:58,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:21:58,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151232416] [2025-03-08 00:21:58,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151232416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:21:58,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545024849] [2025-03-08 00:21:58,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:21:58,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:58,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:21:58,627 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:21:58,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:21:58,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-08 00:21:58,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 00:21:58,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:21:58,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:58,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:21:58,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:21:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 00:21:58,728 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:21:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 00:21:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545024849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:21:58,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:21:58,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-08 00:21:58,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744500626] [2025-03-08 00:21:58,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:21:58,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:21:58,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:21:58,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:21:58,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:21:58,796 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:21:58,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:21:58,829 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2025-03-08 00:21:58,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:21:58,829 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 42 [2025-03-08 00:21:58,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:21:58,830 INFO L225 Difference]: With dead ends: 67 [2025-03-08 00:21:58,830 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 00:21:58,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:21:58,831 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:21:58,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 83 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:21:58,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 00:21:58,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-03-08 00:21:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:21:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2025-03-08 00:21:58,837 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 42 [2025-03-08 00:21:58,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:21:58,837 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-03-08 00:21:58,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:21:58,837 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2025-03-08 00:21:58,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 00:21:58,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:58,838 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:21:58,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 00:21:59,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:59,039 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:59,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:59,039 INFO L85 PathProgramCache]: Analyzing trace with hash -192295503, now seen corresponding path program 3 times [2025-03-08 00:21:59,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:59,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626383201] [2025-03-08 00:21:59,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:21:59,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:59,050 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 6 equivalence classes. [2025-03-08 00:21:59,053 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 57 statements. [2025-03-08 00:21:59,053 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:21:59,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-08 00:21:59,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:21:59,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626383201] [2025-03-08 00:21:59,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626383201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:21:59,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:21:59,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:21:59,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71847942] [2025-03-08 00:21:59,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:21:59,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:21:59,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:21:59,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:21:59,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:21:59,081 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:21:59,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:21:59,098 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2025-03-08 00:21:59,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:21:59,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2025-03-08 00:21:59,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:21:59,102 INFO L225 Difference]: With dead ends: 70 [2025-03-08 00:21:59,102 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 00:21:59,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:21:59,103 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:21:59,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 65 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:21:59,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 00:21:59,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2025-03-08 00:21:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:21:59,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2025-03-08 00:21:59,110 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 57 [2025-03-08 00:21:59,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:21:59,110 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2025-03-08 00:21:59,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-08 00:21:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2025-03-08 00:21:59,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 00:21:59,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:59,112 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:21:59,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:21:59,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:59,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:59,113 INFO L85 PathProgramCache]: Analyzing trace with hash -246995094, now seen corresponding path program 1 times [2025-03-08 00:21:59,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:59,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697399413] [2025-03-08 00:21:59,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:59,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:59,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 00:21:59,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 00:21:59,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:59,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:59,218 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-08 00:21:59,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:21:59,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697399413] [2025-03-08 00:21:59,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697399413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:21:59,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645409341] [2025-03-08 00:21:59,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:59,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:59,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:21:59,221 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:21:59,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:21:59,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 00:21:59,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 00:21:59,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:59,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:59,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:21:59,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:21:59,325 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 61 proven. 7 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-08 00:21:59,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:21:59,366 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 5 proven. 81 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-08 00:21:59,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645409341] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:21:59,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:21:59,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2025-03-08 00:21:59,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426706106] [2025-03-08 00:21:59,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:21:59,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:21:59,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:21:59,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:21:59,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:21:59,368 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:21:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:21:59,401 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2025-03-08 00:21:59,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:21:59,401 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2025-03-08 00:21:59,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:21:59,402 INFO L225 Difference]: With dead ends: 76 [2025-03-08 00:21:59,402 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 00:21:59,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:21:59,403 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:21:59,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 123 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:21:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 00:21:59,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-08 00:21:59,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:21:59,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2025-03-08 00:21:59,407 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 66 [2025-03-08 00:21:59,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:21:59,407 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2025-03-08 00:21:59,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:21:59,407 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2025-03-08 00:21:59,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-08 00:21:59,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:59,408 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 18, 10, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:21:59,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 00:21:59,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:59,609 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:59,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:59,609 INFO L85 PathProgramCache]: Analyzing trace with hash 799764285, now seen corresponding path program 2 times [2025-03-08 00:21:59,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:59,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250477168] [2025-03-08 00:21:59,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:21:59,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:59,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-03-08 00:21:59,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 00:21:59,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:21:59,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2025-03-08 00:21:59,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:21:59,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250477168] [2025-03-08 00:21:59,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250477168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:21:59,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572260904] [2025-03-08 00:21:59,770 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:21:59,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:59,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:21:59,772 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:21:59,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:21:59,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-03-08 00:21:59,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 103 of 103 statements. [2025-03-08 00:21:59,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:21:59,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:59,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 00:21:59,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:21:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 326 proven. 70 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-08 00:21:59,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:22:00,041 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2025-03-08 00:22:00,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572260904] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:22:00,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:22:00,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 15 [2025-03-08 00:22:00,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306147042] [2025-03-08 00:22:00,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:22:00,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:22:00,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:22:00,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:22:00,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:22:00,043 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:22:00,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:22:00,099 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2025-03-08 00:22:00,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 00:22:00,100 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 103 [2025-03-08 00:22:00,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:22:00,101 INFO L225 Difference]: With dead ends: 99 [2025-03-08 00:22:00,101 INFO L226 Difference]: Without dead ends: 62 [2025-03-08 00:22:00,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 190 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:22:00,101 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:22:00,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 120 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:22:00,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-08 00:22:00,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-08 00:22:00,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 57 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:22:00,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2025-03-08 00:22:00,110 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 103 [2025-03-08 00:22:00,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:22:00,111 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2025-03-08 00:22:00,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:22:00,112 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2025-03-08 00:22:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 00:22:00,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:22:00,115 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:22:00,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 00:22:00,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:22:00,316 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:22:00,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:22:00,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1407175634, now seen corresponding path program 3 times [2025-03-08 00:22:00,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:22:00,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251766490] [2025-03-08 00:22:00,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:22:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:22:00,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 131 statements into 22 equivalence classes. [2025-03-08 00:22:00,352 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 45 of 131 statements. [2025-03-08 00:22:00,353 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:22:00,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:22:00,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1465 trivial. 0 not checked. [2025-03-08 00:22:00,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:22:00,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251766490] [2025-03-08 00:22:00,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251766490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:22:00,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496385921] [2025-03-08 00:22:00,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:22:00,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:22:00,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:22:00,407 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:22:00,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:22:00,476 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 131 statements into 22 equivalence classes. [2025-03-08 00:22:00,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 45 of 131 statements. [2025-03-08 00:22:00,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:22:00,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:22:00,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 00:22:00,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:22:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 650 proven. 6 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2025-03-08 00:22:00,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:22:00,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1465 trivial. 0 not checked. [2025-03-08 00:22:00,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496385921] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:22:00,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:22:00,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-08 00:22:00,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572143476] [2025-03-08 00:22:00,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:22:00,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:22:00,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:22:00,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:22:00,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:22:00,566 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:22:00,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:22:00,586 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2025-03-08 00:22:00,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:22:00,586 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 131 [2025-03-08 00:22:00,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:22:00,587 INFO L225 Difference]: With dead ends: 107 [2025-03-08 00:22:00,587 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 00:22:00,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:22:00,588 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:22:00,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:22:00,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 00:22:00,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-08 00:22:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:22:00,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2025-03-08 00:22:00,599 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 131 [2025-03-08 00:22:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:22:00,599 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2025-03-08 00:22:00,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:22:00,600 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2025-03-08 00:22:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 00:22:00,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:22:00,602 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:22:00,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 00:22:00,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:22:00,802 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:22:00,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:22:00,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1660538079, now seen corresponding path program 4 times [2025-03-08 00:22:00,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:22:00,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615863472] [2025-03-08 00:22:00,803 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:22:00,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:22:00,819 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 136 statements into 2 equivalence classes. [2025-03-08 00:22:00,853 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 00:22:00,853 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:22:00,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:22:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1465 trivial. 0 not checked. [2025-03-08 00:22:01,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:22:01,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615863472] [2025-03-08 00:22:01,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615863472] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:22:01,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424345775] [2025-03-08 00:22:01,068 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:22:01,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:22:01,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:22:01,070 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:22:01,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:22:01,137 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 136 statements into 2 equivalence classes. [2025-03-08 00:22:01,205 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 00:22:01,206 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:22:01,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:22:01,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:22:01,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:22:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2025-03-08 00:22:01,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:22:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1501 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1465 trivial. 0 not checked. [2025-03-08 00:22:01,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424345775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:22:01,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:22:01,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2025-03-08 00:22:01,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664039042] [2025-03-08 00:22:01,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:22:01,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:22:01,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:22:01,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:22:01,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:22:01,305 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:22:01,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:22:01,321 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2025-03-08 00:22:01,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:22:01,321 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 136 [2025-03-08 00:22:01,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:22:01,322 INFO L225 Difference]: With dead ends: 108 [2025-03-08 00:22:01,322 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 00:22:01,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 263 SyntacticMatches, 9 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:22:01,323 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:22:01,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:22:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 00:22:01,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-08 00:22:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.126984126984127) internal successors, (71), 63 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:22:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2025-03-08 00:22:01,328 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 136 [2025-03-08 00:22:01,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:22:01,328 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2025-03-08 00:22:01,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:22:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2025-03-08 00:22:01,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 00:22:01,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:22:01,329 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 18, 12, 10, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:22:01,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 00:22:01,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:22:01,530 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:22:01,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:22:01,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1225805646, now seen corresponding path program 5 times [2025-03-08 00:22:01,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:22:01,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454562788] [2025-03-08 00:22:01,531 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:22:01,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:22:01,548 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 137 statements into 22 equivalence classes. [2025-03-08 00:22:01,770 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 00:22:01,770 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2025-03-08 00:22:01,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:22:01,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [85125967] [2025-03-08 00:22:01,776 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:22:01,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:22:01,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:22:01,778 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:22:01,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:22:01,853 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 137 statements into 22 equivalence classes. [2025-03-08 00:22:05,980 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 00:22:05,980 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2025-03-08 00:22:05,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:22:05,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 00:22:06,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 00:22:06,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 00:22:06,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:22:06,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:22:06,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 00:22:06,381 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 00:22:06,382 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:22:06,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 00:22:06,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 00:22:06,586 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1] [2025-03-08 00:22:06,647 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:22:06,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:22:06 BoogieIcfgContainer [2025-03-08 00:22:06,650 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:22:06,651 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:22:06,651 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:22:06,651 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:22:06,652 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:21:56" (3/4) ... [2025-03-08 00:22:06,652 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 00:22:06,743 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 97. [2025-03-08 00:22:06,808 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:22:06,808 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:22:06,808 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:22:06,809 INFO L158 Benchmark]: Toolchain (without parser) took 10853.08ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 112.6MB in the beginning and 385.6MB in the end (delta: -273.1MB). Peak memory consumption was 245.9MB. Max. memory is 16.1GB. [2025-03-08 00:22:06,809 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:22:06,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.68ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 101.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:22:06,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.78ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 99.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:22:06,809 INFO L158 Benchmark]: Boogie Preprocessor took 36.82ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:22:06,809 INFO L158 Benchmark]: IcfgBuilder took 273.50ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 85.1MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:22:06,810 INFO L158 Benchmark]: TraceAbstraction took 10197.48ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 84.6MB in the beginning and 156.9MB in the end (delta: -72.3MB). Peak memory consumption was 212.2MB. Max. memory is 16.1GB. [2025-03-08 00:22:06,810 INFO L158 Benchmark]: Witness Printer took 157.61ms. Allocated memory is still 427.8MB. Free memory was 156.9MB in the beginning and 385.6MB in the end (delta: -228.8MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2025-03-08 00:22:06,816 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.22ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 157.68ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 101.3MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.78ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 99.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.82ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 98.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 273.50ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 85.1MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10197.48ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 84.6MB in the beginning and 156.9MB in the end (delta: -72.3MB). Peak memory consumption was 212.2MB. Max. memory is 16.1GB. * Witness Printer took 157.61ms. Allocated memory is still 427.8MB. Free memory was 156.9MB in the beginning and 385.6MB in the end (delta: -228.8MB). Peak memory consumption was 8.6MB. 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 - CounterExampleResult [Line: 61]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L42] int x[10]; [L43] CALL init_nondet(x) [L16] int i; [L17] i = 0 VAL [i=0, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=1, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=2, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=3, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=4, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=5, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=6, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=7, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=8, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=9, x={3:0}] [L17] COND TRUE i < 10 [L18] x[i] = __VERIFIER_nondet_int() [L17] i++ VAL [i=10, x={3:0}] [L17] COND FALSE !(i < 10) [L43] RET init_nondet(x) [L44] int temp; [L45] int ret; [L46] int ret2; [L47] int ret5; VAL [x={3:0}] [L49] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=6, ret=-10, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=-10, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=1, i=7, ret=-10, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=7, ret=8, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=8, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=2, i=8, ret=8, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=8, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=3, i=9, ret=0, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=9, ret=-9, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=-9, x={3:0}] [L28] COND FALSE !(i < 10) VAL [\old(x)={3:0}, cnt=4, ret=-9, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-2, x={3:0}] [L49] RET, EXPR rangesum(x) VAL [x={3:0}] [L49] ret = rangesum(x) [L51] EXPR x[0] [L51] temp=x[0] [L51] EXPR x[1] [L51] x[0] = x[1] [L51] x[1] = temp [L52] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=6, ret=-10, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=-10, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=1, i=7, ret=-10, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=7, ret=8, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=8, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=2, i=8, ret=8, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=8, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=3, i=9, ret=0, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=9, ret=-9, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=-9, x={3:0}] [L28] COND FALSE !(i < 10) VAL [\old(x)={3:0}, cnt=4, ret=-9, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-2, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [ret=-2, x={3:0}] [L52] ret2 = rangesum(x) [L53] EXPR x[0] [L53] temp=x[0] [L54] int i =0 ; VAL [i=0, ret2=-2, ret=-2, temp=-6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=1, ret2=-2, ret=-2, temp=-6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=2, ret2=-2, ret=-2, temp=-6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=3, ret2=-2, ret=-2, temp=-6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=4, ret2=-2, ret=-2, temp=-6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=5, ret2=-2, ret=-2, temp=-6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=6, ret2=-2, ret=-2, temp=-6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=7, ret2=-2, ret=-2, temp=-6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=8, ret2=-2, ret=-2, temp=-6, x={3:0}] [L54] COND TRUE i<10 -1 [L55] EXPR x[i+1] [L55] x[i] = x[i+1] [L54] i++ VAL [i=9, ret2=-2, ret=-2, temp=-6, x={3:0}] [L54] COND FALSE !(i<10 -1) [L57] x[10 -1] = temp [L58] CALL, EXPR rangesum(x) VAL [\old(x)={3:0}] [L24] int i; [L25] long long ret; [L26] ret = 0 [L27] int cnt = 0; [L28] i = 0 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=3, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=4, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L29] COND FALSE !(i > 10/2) VAL [\old(x)={3:0}, cnt=0, i=5, ret=0, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=0, i=6, ret=0, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=1, i=6, ret=18, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=1, i=7, ret=18, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=1, i=7, ret=18, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=2, i=7, ret=10, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=2, i=8, ret=10, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=2, i=8, ret=10, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=3, i=8, ret=1, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=3, i=9, ret=1, x={3:0}] [L28] COND TRUE i < 10 VAL [\old(x)={3:0}, cnt=3, i=9, ret=1, x={3:0}] [L29] COND TRUE i > 10/2 [L30] EXPR x[i] [L30] ret = ret + x[i] [L31] cnt = cnt + 1 VAL [\old(x)={3:0}, cnt=4, i=9, ret=-5, x={3:0}] [L28] i++ VAL [\old(x)={3:0}, cnt=4, i=10, ret=-5, x={3:0}] [L28] COND FALSE !(i < 10) VAL [\old(x)={3:0}, cnt=4, ret=-5, x={3:0}] [L34] COND TRUE cnt !=0 [L35] return ret / cnt; VAL [\old(x)={3:0}, \result=-1, x={3:0}] [L58] RET, EXPR rangesum(x) VAL [ret2=-2, ret=-2, x={3:0}] [L58] ret5 = rangesum(x) [L60] COND TRUE ret != ret2 || ret !=ret5 VAL [x={3:0}] [L61] reach_error() VAL [x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 35 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 12, TraceHistogramMax: 30, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 852 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 578 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 203 IncrementalHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 274 mSDtfsCounter, 203 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1178 GetRequests, 1095 SyntacticMatches, 15 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=11, InterpolantAutomatonStates: 82, 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, 11 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1605 NumberOfCodeBlocks, 1402 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 1822 ConstructedInterpolants, 0 QuantifiedInterpolants, 2102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2147 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 26 InterpolantComputations, 5 PerfectInterpolantSequences, 11655/12388 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 proved your program to be incorrect! [2025-03-08 00:22:06,835 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE