./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/rangesum.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/rangesum.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 4dc91bf2fc8981aab63c1ee768384f1c8f580edfe4618d65089a78f799b6ddb8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:21:43,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:21:43,409 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:43,413 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:21:43,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:21:43,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:21:43,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:21:43,427 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:21:43,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:21:43,428 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:21:43,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:21:43,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:21:43,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:21:43,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:21:43,428 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:21:43,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:21:43,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:21:43,429 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:21:43,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:21:43,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:21:43,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:21:43,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:21:43,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:21:43,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:21:43,429 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:21:43,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:21:43,429 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:21:43,429 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:21:43,430 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:21:43,430 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:21:43,430 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:21:43,430 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:21:43,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:21:43,430 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:21:43,430 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:21:43,430 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:21:43,430 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:21:43,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:21:43,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:21:43,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:21:43,431 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:21:43,431 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:21:43,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:21:43,431 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 -> 4dc91bf2fc8981aab63c1ee768384f1c8f580edfe4618d65089a78f799b6ddb8 [2025-03-08 00:21:43,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:21:43,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:21:43,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:21:43,684 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:21:43,684 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:21:43,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/rangesum.i [2025-03-08 00:21:44,786 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d1a2e22/0f99fe24978b4d6c9c57374b4b062f06/FLAG449c96dc9 [2025-03-08 00:21:45,090 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:21:45,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/rangesum.i [2025-03-08 00:21:45,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d1a2e22/0f99fe24978b4d6c9c57374b4b062f06/FLAG449c96dc9 [2025-03-08 00:21:45,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d1a2e22/0f99fe24978b4d6c9c57374b4b062f06 [2025-03-08 00:21:45,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:21:45,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:21:45,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:21:45,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:21:45,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:21:45,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:21:45" (1/1) ... [2025-03-08 00:21:45,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@721af818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:45, skipping insertion in model container [2025-03-08 00:21:45,377 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:21:45" (1/1) ... [2025-03-08 00:21:45,386 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:21:45,489 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/rangesum.i[1544,1557] [2025-03-08 00:21:45,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:21:45,502 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:21:45,522 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/rangesum.i[1544,1557] [2025-03-08 00:21:45,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:21:45,538 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:21:45,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:45 WrapperNode [2025-03-08 00:21:45,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:21:45,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:21:45,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:21:45,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:21:45,544 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:45" (1/1) ... [2025-03-08 00:21:45,549 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:45" (1/1) ... [2025-03-08 00:21:45,561 INFO L138 Inliner]: procedures = 17, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2025-03-08 00:21:45,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:21:45,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:21:45,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:21:45,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:21:45,567 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:45" (1/1) ... [2025-03-08 00:21:45,568 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:45" (1/1) ... [2025-03-08 00:21:45,569 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:45" (1/1) ... [2025-03-08 00:21:45,586 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:45,587 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:45" (1/1) ... [2025-03-08 00:21:45,587 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:45" (1/1) ... [2025-03-08 00:21:45,592 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:45" (1/1) ... [2025-03-08 00:21:45,595 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:45" (1/1) ... [2025-03-08 00:21:45,596 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:45" (1/1) ... [2025-03-08 00:21:45,597 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:45" (1/1) ... [2025-03-08 00:21:45,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:21:45,601 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:21:45,601 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:21:45,601 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:21:45,602 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:45" (1/1) ... [2025-03-08 00:21:45,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:21:45,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:21:45,628 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:45,631 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:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:21:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:21:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:21:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:21:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:21:45,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:21:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:21:45,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:21:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:21:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:21:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2025-03-08 00:21:45,653 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2025-03-08 00:21:45,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:21:45,705 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:21:45,707 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:21:45,846 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-08 00:21:45,846 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:21:45,852 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:21:45,852 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:21:45,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:21:45 BoogieIcfgContainer [2025-03-08 00:21:45,853 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:21:45,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:21:45,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:21:45,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:21:45,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:21:45" (1/3) ... [2025-03-08 00:21:45,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581b0688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:21:45, skipping insertion in model container [2025-03-08 00:21:45,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:21:45" (2/3) ... [2025-03-08 00:21:45,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581b0688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:21:45, skipping insertion in model container [2025-03-08 00:21:45,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:21:45" (3/3) ... [2025-03-08 00:21:45,860 INFO L128 eAbstractionObserver]: Analyzing ICFG rangesum.i [2025-03-08 00:21:45,872 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:21:45,873 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rangesum.i that has 2 procedures, 27 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:21:45,910 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:21:45,920 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;@11f0a67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:21:45,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:21:45,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 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:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:21:45,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:45,930 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:45,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:45,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:45,935 INFO L85 PathProgramCache]: Analyzing trace with hash 267290290, now seen corresponding path program 1 times [2025-03-08 00:21:45,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:45,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626440507] [2025-03-08 00:21:45,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:45,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:46,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 00:21:46,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:21:46,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:46,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:46,244 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:46,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:21:46,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626440507] [2025-03-08 00:21:46,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626440507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:21:46,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:21:46,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:21:46,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335281276] [2025-03-08 00:21:46,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:21:46,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:21:46,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:21:46,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:21:46,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:21:46,264 INFO L87 Difference]: Start difference. First operand has 27 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 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 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:21:46,312 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2025-03-08 00:21:46,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:21:46,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 29 [2025-03-08 00:21:46,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:21:46,319 INFO L225 Difference]: With dead ends: 51 [2025-03-08 00:21:46,319 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 00:21:46,321 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:46,325 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:21:46,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:21:46,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 00:21:46,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-08 00:21:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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:46,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2025-03-08 00:21:46,350 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 29 [2025-03-08 00:21:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:21:46,350 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2025-03-08 00:21:46,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2025-03-08 00:21:46,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:21:46,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:46,352 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, 1] [2025-03-08 00:21:46,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:21:46,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:46,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:46,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1251127747, now seen corresponding path program 1 times [2025-03-08 00:21:46,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:46,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484131984] [2025-03-08 00:21:46,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:46,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:46,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 00:21:46,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:21:46,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:46,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:46,556 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:21:46,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:21:46,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484131984] [2025-03-08 00:21:46,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484131984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:21:46,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046102940] [2025-03-08 00:21:46,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:46,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:46,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:21:46,561 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:46,562 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:46,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 00:21:46,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:21:46,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:46,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:46,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:21:46,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:21:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:21:46,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:21:46,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046102940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:21:46,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:21:46,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 00:21:46,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120725714] [2025-03-08 00:21:46,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:21:46,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:21:46,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:21:46,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:21:46,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:21:46,665 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:46,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:21:46,679 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2025-03-08 00:21:46,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:21:46,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 30 [2025-03-08 00:21:46,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:21:46,681 INFO L225 Difference]: With dead ends: 43 [2025-03-08 00:21:46,681 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 00:21:46,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:21:46,682 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 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:46,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 51 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:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 00:21:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-08 00:21:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-03-08 00:21:46,686 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 30 [2025-03-08 00:21:46,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:21:46,686 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-08 00:21:46,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-03-08 00:21:46,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:21:46,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:46,687 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, 1] [2025-03-08 00:21:46,694 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:46,892 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:46,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:46,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:46,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1516706308, now seen corresponding path program 1 times [2025-03-08 00:21:46,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:46,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000648997] [2025-03-08 00:21:46,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:46,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:46,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 00:21:46,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:21:46,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:46,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:46,985 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:21:46,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:21:46,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000648997] [2025-03-08 00:21:46,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000648997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:21:46,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779238063] [2025-03-08 00:21:46,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:46,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:46,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:21:46,988 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:46,989 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:47,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-08 00:21:47,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:21:47,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:47,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:47,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:21:47,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:21:47,101 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:47,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:21:47,158 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:47,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779238063] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:21:47,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:21:47,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-03-08 00:21:47,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583840466] [2025-03-08 00:21:47,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:21:47,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:21:47,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:21:47,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:21:47,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:21:47,160 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:21:47,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:21:47,241 INFO L93 Difference]: Finished difference Result 53 states and 74 transitions. [2025-03-08 00:21:47,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:21:47,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 30 [2025-03-08 00:21:47,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:21:47,243 INFO L225 Difference]: With dead ends: 53 [2025-03-08 00:21:47,243 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 00:21:47,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:21:47,244 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:21:47,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 65 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:21:47,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 00:21:47,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-03-08 00:21:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-03-08 00:21:47,251 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 30 [2025-03-08 00:21:47,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:21:47,251 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-03-08 00:21:47,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:21:47,252 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2025-03-08 00:21:47,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 00:21:47,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:47,253 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:21:47,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 00:21:47,453 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:47,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:47,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash 696738924, now seen corresponding path program 1 times [2025-03-08 00:21:47,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:47,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204853366] [2025-03-08 00:21:47,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:47,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:47,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-08 00:21:47,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 00:21:47,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:47,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:47,550 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 00:21:47,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:21:47,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204853366] [2025-03-08 00:21:47,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204853366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:21:47,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:21:47,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:21:47,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035069798] [2025-03-08 00:21:47,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:21:47,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:21:47,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:21:47,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:21:47,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:21:47,552 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:21:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:21:47,579 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2025-03-08 00:21:47,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:21:47,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2025-03-08 00:21:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:21:47,580 INFO L225 Difference]: With dead ends: 49 [2025-03-08 00:21:47,580 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 00:21:47,580 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:47,582 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:21:47,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 30 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:21:47,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 00:21:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-08 00:21:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2025-03-08 00:21:47,589 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 40 [2025-03-08 00:21:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:21:47,590 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2025-03-08 00:21:47,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:21:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2025-03-08 00:21:47,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:21:47,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:47,591 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:21:47,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:21:47,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:47,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:47,591 INFO L85 PathProgramCache]: Analyzing trace with hash 779390775, now seen corresponding path program 1 times [2025-03-08 00:21:47,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:47,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923848918] [2025-03-08 00:21:47,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:47,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:47,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 00:21:47,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:21:47,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:47,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 00:21:47,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:21:47,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923848918] [2025-03-08 00:21:47,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923848918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:21:47,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:21:47,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 00:21:47,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284266962] [2025-03-08 00:21:47,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:21:47,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:21:47,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:21:47,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:21:47,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:21:47,803 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 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:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:21:47,870 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2025-03-08 00:21:47,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:21:47,871 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 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) Word has length 41 [2025-03-08 00:21:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:21:47,872 INFO L225 Difference]: With dead ends: 51 [2025-03-08 00:21:47,872 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 00:21:47,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:21:47,873 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:21:47,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 165 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:21:47,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 00:21:47,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2025-03-08 00:21:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 00:21:47,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2025-03-08 00:21:47,883 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 41 [2025-03-08 00:21:47,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:21:47,883 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2025-03-08 00:21:47,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 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:47,883 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2025-03-08 00:21:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:21:47,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:47,885 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:21:47,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 00:21:47,885 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:47,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:47,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1623473540, now seen corresponding path program 1 times [2025-03-08 00:21:47,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:47,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944197814] [2025-03-08 00:21:47,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:47,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:47,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:21:47,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:21:47,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:47,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 00:21:47,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:21:47,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944197814] [2025-03-08 00:21:47,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944197814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:21:47,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616469107] [2025-03-08 00:21:47,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:47,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:47,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:21:47,994 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:47,996 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:48,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-08 00:21:48,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:21:48,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:48,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:48,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:21:48,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:21:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 00:21:48,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:21:48,214 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 00:21:48,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616469107] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:21:48,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:21:48,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-03-08 00:21:48,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611194351] [2025-03-08 00:21:48,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:21:48,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:21:48,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:21:48,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:21:48,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:21:48,215 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:21:48,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:21:48,275 INFO L93 Difference]: Finished difference Result 74 states and 110 transitions. [2025-03-08 00:21:48,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:21:48,275 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2025-03-08 00:21:48,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:21:48,276 INFO L225 Difference]: With dead ends: 74 [2025-03-08 00:21:48,276 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 00:21:48,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:21:48,277 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:21:48,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 49 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:21:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 00:21:48,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-03-08 00:21:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 35 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 00:21:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2025-03-08 00:21:48,282 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 44 [2025-03-08 00:21:48,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:21:48,282 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-03-08 00:21:48,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:21:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2025-03-08 00:21:48,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 00:21:48,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:48,283 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:21:48,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 00:21:48,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:48,484 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:48,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:48,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2068343783, now seen corresponding path program 2 times [2025-03-08 00:21:48,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:48,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729882712] [2025-03-08 00:21:48,485 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:21:48,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:48,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-08 00:21:48,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 00:21:48,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:21:48,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 1 proven. 68 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 00:21:48,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:21:48,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729882712] [2025-03-08 00:21:48,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729882712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:21:48,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597267898] [2025-03-08 00:21:48,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:21:48,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:48,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:21:48,645 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:48,646 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:48,698 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-03-08 00:21:48,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 00:21:48,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:21:48,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:48,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:21:48,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:21:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-08 00:21:48,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:21:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 12 proven. 57 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-08 00:21:48,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597267898] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:21:48,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:21:48,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2025-03-08 00:21:48,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067758866] [2025-03-08 00:21:48,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:21:48,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:21:48,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:21:48,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:21:48,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:21:48,950 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:21:49,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:21:49,104 INFO L93 Difference]: Finished difference Result 114 states and 154 transitions. [2025-03-08 00:21:49,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:21:49,107 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 53 [2025-03-08 00:21:49,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:21:49,108 INFO L225 Difference]: With dead ends: 114 [2025-03-08 00:21:49,108 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 00:21:49,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 95 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-03-08 00:21:49,109 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 33 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:21:49,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 175 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:21:49,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 00:21:49,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-03-08 00:21:49,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 50 states have internal predecessors, (59), 7 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-08 00:21:49,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2025-03-08 00:21:49,116 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 53 [2025-03-08 00:21:49,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:21:49,117 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2025-03-08 00:21:49,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.588235294117647) internal successors, (61), 17 states have internal predecessors, (61), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-08 00:21:49,117 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2025-03-08 00:21:49,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 00:21:49,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:49,118 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:21:49,124 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:49,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:49,319 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:49,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:49,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1649093284, now seen corresponding path program 3 times [2025-03-08 00:21:49,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:49,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285826155] [2025-03-08 00:21:49,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:21:49,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:49,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 7 equivalence classes. [2025-03-08 00:21:49,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 54 statements. [2025-03-08 00:21:49,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:21:49,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-03-08 00:21:49,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:21:49,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285826155] [2025-03-08 00:21:49,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285826155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:21:49,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397873657] [2025-03-08 00:21:49,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:21:49,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:49,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:21:49,469 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:49,470 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:49,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 7 equivalence classes. [2025-03-08 00:21:49,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 54 statements. [2025-03-08 00:21:49,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:21:49,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:21:49,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:21:49,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:21:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 52 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-08 00:21:49,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:21:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-08 00:21:49,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397873657] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:21:49,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:21:49,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2025-03-08 00:21:49,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404056356] [2025-03-08 00:21:49,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:21:49,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:21:49,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:21:49,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:21:49,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:21:49,694 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:21:49,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:21:49,813 INFO L93 Difference]: Finished difference Result 107 states and 152 transitions. [2025-03-08 00:21:49,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:21:49,813 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 54 [2025-03-08 00:21:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:21:49,814 INFO L225 Difference]: With dead ends: 107 [2025-03-08 00:21:49,814 INFO L226 Difference]: Without dead ends: 56 [2025-03-08 00:21:49,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:21:49,815 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:21:49,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 117 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:21:49,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-08 00:21:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2025-03-08 00:21:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 36 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 00:21:49,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2025-03-08 00:21:49,820 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 54 [2025-03-08 00:21:49,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:21:49,820 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2025-03-08 00:21:49,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 states have internal predecessors, (55), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:21:49,821 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2025-03-08 00:21:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-08 00:21:49,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:21:49,821 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:21:49,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 00:21:50,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:50,022 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:21:50,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:21:50,022 INFO L85 PathProgramCache]: Analyzing trace with hash 327997345, now seen corresponding path program 1 times [2025-03-08 00:21:50,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:21:50,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127903716] [2025-03-08 00:21:50,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:50,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:21:50,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 00:21:50,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 00:21:50,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:50,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:21:50,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [673514536] [2025-03-08 00:21:50,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:21:50,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:50,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:21:50,107 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:50,108 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:50,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 00:21:50,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 00:21:50,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:50,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:21:50,203 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 00:21:50,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-08 00:21:50,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-08 00:21:50,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:21:50,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 00:21:50,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 00:21:50,277 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 00:21:50,278 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:21:50,287 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:50,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:21:50,483 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-03-08 00:21:50,528 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:21:50,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:21:50 BoogieIcfgContainer [2025-03-08 00:21:50,532 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:21:50,532 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:21:50,532 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:21:50,532 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:21:50,533 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:45" (3/4) ... [2025-03-08 00:21:50,533 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 00:21:50,590 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 42. [2025-03-08 00:21:50,638 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:21:50,638 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:21:50,638 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:21:50,639 INFO L158 Benchmark]: Toolchain (without parser) took 5267.01ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 54.4MB in the end (delta: 50.9MB). Peak memory consumption was 51.6MB. Max. memory is 16.1GB. [2025-03-08 00:21:50,639 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:21:50,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.13ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 93.9MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:21:50,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.67ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:21:50,640 INFO L158 Benchmark]: Boogie Preprocessor took 38.93ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 91.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:21:50,640 INFO L158 Benchmark]: IcfgBuilder took 251.43ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 77.1MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:21:50,640 INFO L158 Benchmark]: TraceAbstraction took 4677.78ms. Allocated memory is still 142.6MB. Free memory was 76.5MB in the beginning and 62.9MB in the end (delta: 13.6MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2025-03-08 00:21:50,640 INFO L158 Benchmark]: Witness Printer took 106.17ms. Allocated memory is still 142.6MB. Free memory was 62.9MB in the beginning and 54.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:21:50,641 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.25ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.13ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 93.9MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.67ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.93ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 91.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 251.43ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 77.1MB in the end (delta: 14.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4677.78ms. Allocated memory is still 142.6MB. Free memory was 76.5MB in the beginning and 62.9MB in the end (delta: 13.6MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Witness Printer took 106.17ms. Allocated memory is still 142.6MB. Free memory was 62.9MB in the beginning and 54.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 64]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L15] int N; VAL [N=0] [L43] N = __VERIFIER_nondet_int() [L44] COND TRUE N > 1 [L45] int x[N]; [L46] CALL init_nondet(x) [L17] int i; [L18] i = 0 VAL [N=3, i=0, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [N=3, i=1, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [N=3, i=2, x={3:0}] [L18] COND TRUE i < N [L19] x[i] = __VERIFIER_nondet_int() [L18] i++ VAL [N=3, i=3, x={3:0}] [L18] COND FALSE !(i < N) VAL [N=3] [L46] RET init_nondet(x) [L47] int temp; [L48] int ret; [L49] int ret2; [L50] int ret5; VAL [N=3, x={3:0}] [L52] CALL, EXPR rangesum(x) VAL [N=3, \old(x)={3:0}] [L25] int i; [L26] long long ret; [L27] ret = 0 [L28] int cnt = 0; [L29] i = 0 VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [N=3, \old(x)={3:0}, cnt=1, i=2, ret=2, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=1, i=3, ret=2, x={3:0}] [L29] COND FALSE !(i < N) VAL [N=3, \old(x)={3:0}, cnt=1, ret=2, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [N=3, \old(x)={3:0}, \result=2, x={3:0}] [L52] RET, EXPR rangesum(x) VAL [N=3, x={3:0}] [L52] ret = rangesum(x) [L54] EXPR x[0] [L54] temp=x[0] [L54] EXPR x[1] [L54] x[0] = x[1] [L54] x[1] = temp VAL [N=3] [L55] CALL, EXPR rangesum(x) VAL [N=3, \old(x)={3:0}] [L25] int i; [L26] long long ret; [L27] ret = 0 [L28] int cnt = 0; [L29] i = 0 VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [N=3, \old(x)={3:0}, cnt=1, i=2, ret=2, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=1, i=3, ret=2, x={3:0}] [L29] COND FALSE !(i < N) VAL [N=3, \old(x)={3:0}, cnt=1, ret=2, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [N=3, \old(x)={3:0}, \result=2, x={3:0}] [L55] RET, EXPR rangesum(x) VAL [N=3, ret=2, x={3:0}] [L55] ret2 = rangesum(x) [L56] EXPR x[0] [L56] temp=x[0] [L57] int i =0 ; VAL [N=3, i=0, ret2=2, ret=2, temp=0, x={3:0}] [L57] COND TRUE i N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=0, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L30] COND FALSE !(i > N/2) VAL [N=3, \old(x)={3:0}, cnt=0, i=1, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L29] COND TRUE i < N VAL [N=3, \old(x)={3:0}, cnt=0, i=2, ret=0, x={3:0}] [L30] COND TRUE i > N/2 [L31] EXPR x[i] [L31] ret = ret + x[i] [L32] cnt = cnt + 1 VAL [N=3, \old(x)={3:0}, cnt=1, i=2, ret=0, x={3:0}] [L29] i++ VAL [N=3, \old(x)={3:0}, cnt=1, i=3, ret=0, x={3:0}] [L29] COND FALSE !(i < N) VAL [N=3, \old(x)={3:0}, cnt=1, ret=0, x={3:0}] [L35] COND TRUE cnt !=0 [L36] return ret / cnt; VAL [N=3, \old(x)={3:0}, \result=0, x={3:0}] [L61] RET, EXPR rangesum(x) VAL [N=3, ret2=2, ret=2, x={3:0}] [L61] ret5 = rangesum(x) [L63] COND TRUE ret != ret2 || ret !=ret5 VAL [N=3, x={3:0}] [L64] reach_error() VAL [N=3, x={3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 38 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 9, TraceHistogramMax: 9, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 706 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 511 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 616 IncrementalHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 195 mSDtfsCounter, 616 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 450 GetRequests, 368 SyntacticMatches, 12 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=7, InterpolantAutomatonStates: 61, 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, 8 MinimizatonAttempts, 24 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 654 NumberOfCodeBlocks, 616 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 696 ConstructedInterpolants, 0 QuantifiedInterpolants, 1306 SizeOfPredicates, 3 NumberOfNonLiveVariables, 870 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 762/942 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:21:50,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE