./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/bAnd4.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/array-crafted/bAnd4.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 509fca01259c1f1b00d88cc0da560b766d69c2e05ff96a251a9cfffa2096619e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:29:09,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:29:09,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:29:09,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:29:09,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:29:09,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:29:09,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:29:09,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:29:09,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:29:09,707 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:29:09,708 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:29:09,708 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:29:09,708 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:29:09,709 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:29:09,709 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:29:09,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:29:09,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:29:09,709 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:29:09,710 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:29:09,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:29:09,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:29:09,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:29:09,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:29:09,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:29:09,710 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:29:09,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:29:09,710 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:29:09,710 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:29:09,710 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:29:09,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:29:09,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:29:09,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:29:09,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:29:09,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:29:09,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:29:09,711 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:29:09,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:29:09,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:29:09,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:29:09,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:29:09,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:29:09,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:29:09,712 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:29:09,712 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 -> 509fca01259c1f1b00d88cc0da560b766d69c2e05ff96a251a9cfffa2096619e [2025-03-08 00:29:09,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:29:09,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:29:09,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:29:09,951 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:29:09,951 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:29:09,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bAnd4.i [2025-03-08 00:29:11,143 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c4a48629/0cf72413e08a4b019cde8790b76a6114/FLAGe5190b16f [2025-03-08 00:29:11,384 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:29:11,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd4.i [2025-03-08 00:29:11,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c4a48629/0cf72413e08a4b019cde8790b76a6114/FLAGe5190b16f [2025-03-08 00:29:11,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c4a48629/0cf72413e08a4b019cde8790b76a6114 [2025-03-08 00:29:11,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:29:11,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:29:11,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:29:11,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:29:11,718 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:29:11,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:29:11" (1/1) ... [2025-03-08 00:29:11,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@304806e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:11, skipping insertion in model container [2025-03-08 00:29:11,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:29:11" (1/1) ... [2025-03-08 00:29:11,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:29:11,836 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/array-crafted/bAnd4.i[1308,1321] [2025-03-08 00:29:11,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:29:11,846 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:29:11,863 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/array-crafted/bAnd4.i[1308,1321] [2025-03-08 00:29:11,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:29:11,878 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:29:11,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:11 WrapperNode [2025-03-08 00:29:11,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:29:11,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:29:11,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:29:11,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:29:11,886 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:29:11" (1/1) ... [2025-03-08 00:29:11,892 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:29:11" (1/1) ... [2025-03-08 00:29:11,903 INFO L138 Inliner]: procedures = 16, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 71 [2025-03-08 00:29:11,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:29:11,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:29:11,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:29:11,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:29:11,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:11" (1/1) ... [2025-03-08 00:29:11,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:11" (1/1) ... [2025-03-08 00:29:11,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:11" (1/1) ... [2025-03-08 00:29:11,928 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 5 writes are split as follows [0, 0, 5]. [2025-03-08 00:29:11,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:11" (1/1) ... [2025-03-08 00:29:11,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:11" (1/1) ... [2025-03-08 00:29:11,936 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:11" (1/1) ... [2025-03-08 00:29:11,939 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:11" (1/1) ... [2025-03-08 00:29:11,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:11" (1/1) ... [2025-03-08 00:29:11,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:11" (1/1) ... [2025-03-08 00:29:11,944 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:29:11,945 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:29:11,945 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:29:11,945 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:29:11,946 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:11" (1/1) ... [2025-03-08 00:29:11,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:29:11,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:29:11,968 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:29:11,970 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:29:11,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:29:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:29:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:29:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:29:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:29:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:29:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:29:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:29:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2025-03-08 00:29:11,986 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2025-03-08 00:29:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:29:11,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:29:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:29:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:29:11,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:29:11,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:29:12,037 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:29:12,038 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:29:12,178 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L31: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-03-08 00:29:12,185 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 00:29:12,185 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:29:12,197 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:29:12,198 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:29:12,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:29:12 BoogieIcfgContainer [2025-03-08 00:29:12,199 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:29:12,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:29:12,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:29:12,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:29:12,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:29:11" (1/3) ... [2025-03-08 00:29:12,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1b7b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:29:12, skipping insertion in model container [2025-03-08 00:29:12,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:29:11" (2/3) ... [2025-03-08 00:29:12,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c1b7b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:29:12, skipping insertion in model container [2025-03-08 00:29:12,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:29:12" (3/3) ... [2025-03-08 00:29:12,206 INFO L128 eAbstractionObserver]: Analyzing ICFG bAnd4.i [2025-03-08 00:29:12,218 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:29:12,219 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bAnd4.i that has 2 procedures, 25 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:29:12,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:29:12,264 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;@198b2018, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:29:12,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:29:12,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:29:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:29:12,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:12,273 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:12,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:12,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:12,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1761542134, now seen corresponding path program 1 times [2025-03-08 00:29:12,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:12,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736256808] [2025-03-08 00:29:12,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:29:12,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:12,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:29:12,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:29:12,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:29:12,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:12,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:29:12,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:29:12,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736256808] [2025-03-08 00:29:12,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736256808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:29:12,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:29:12,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:29:12,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780638947] [2025-03-08 00:29:12,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:29:12,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:29:12,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:29:12,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:29:12,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:29:12,519 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:29:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:29:12,539 INFO L93 Difference]: Finished difference Result 48 states and 62 transitions. [2025-03-08 00:29:12,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:29:12,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 24 [2025-03-08 00:29:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:29:12,544 INFO L225 Difference]: With dead ends: 48 [2025-03-08 00:29:12,544 INFO L226 Difference]: Without dead ends: 22 [2025-03-08 00:29:12,546 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:29:12,548 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:29:12,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:29:12,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-08 00:29:12,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-08 00:29:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:29:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-03-08 00:29:12,573 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 24 [2025-03-08 00:29:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:29:12,573 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-08 00:29:12,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:29:12,573 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-03-08 00:29:12,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:29:12,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:12,574 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:12,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:29:12,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:12,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:12,575 INFO L85 PathProgramCache]: Analyzing trace with hash 505275410, now seen corresponding path program 1 times [2025-03-08 00:29:12,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:12,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119864800] [2025-03-08 00:29:12,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:29:12,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:12,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:29:12,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:29:12,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:29:12,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:12,724 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 00:29:12,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:29:12,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119864800] [2025-03-08 00:29:12,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119864800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:29:12,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563134920] [2025-03-08 00:29:12,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:29:12,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:12,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:29:12,728 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:29:12,728 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:29:12,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:29:12,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:29:12,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:29:12,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:12,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:29:12,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:29:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-08 00:29:12,832 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:29:12,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563134920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:29:12,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:29:12,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:29:12,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476231757] [2025-03-08 00:29:12,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:29:12,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:29:12,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:29:12,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:29:12,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:29:12,834 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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:29:12,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:29:12,845 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2025-03-08 00:29:12,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:29:12,846 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), 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 25 [2025-03-08 00:29:12,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:29:12,846 INFO L225 Difference]: With dead ends: 44 [2025-03-08 00:29:12,846 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 00:29:12,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:29:12,847 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:29:12,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 46 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:29:12,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 00:29:12,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2025-03-08 00:29:12,850 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:29:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2025-03-08 00:29:12,850 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 25 [2025-03-08 00:29:12,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:29:12,851 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2025-03-08 00:29:12,851 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), 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:29:12,851 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2025-03-08 00:29:12,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:29:12,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:12,852 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:12,857 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:29:13,052 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:29:13,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:13,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:13,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1926416319, now seen corresponding path program 1 times [2025-03-08 00:29:13,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:13,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563042952] [2025-03-08 00:29:13,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:29:13,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:13,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:29:13,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:29:13,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:29:13,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 00:29:13,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:29:13,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563042952] [2025-03-08 00:29:13,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563042952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:29:13,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947219025] [2025-03-08 00:29:13,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:29:13,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:13,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:29:13,148 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:29:13,150 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:29:13,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 00:29:13,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:29:13,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:29:13,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:13,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:29:13,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:29:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-08 00:29:13,238 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:29:13,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947219025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:29:13,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:29:13,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:29:13,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847086556] [2025-03-08 00:29:13,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:29:13,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:29:13,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:29:13,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:29:13,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:29:13,239 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:29:13,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:29:13,253 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2025-03-08 00:29:13,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:29:13,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2025-03-08 00:29:13,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:29:13,254 INFO L225 Difference]: With dead ends: 38 [2025-03-08 00:29:13,254 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 00:29:13,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:29:13,256 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:29:13,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:29:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 00:29:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-08 00:29:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:29:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-03-08 00:29:13,262 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 34 [2025-03-08 00:29:13,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:29:13,263 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-03-08 00:29:13,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:29:13,263 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-03-08 00:29:13,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:29:13,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:13,263 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:13,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:29:13,464 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:29:13,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:13,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:13,465 INFO L85 PathProgramCache]: Analyzing trace with hash 189009917, now seen corresponding path program 1 times [2025-03-08 00:29:13,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:13,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33228008] [2025-03-08 00:29:13,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:29:13,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:13,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 00:29:13,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:29:13,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:29:13,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:13,529 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 00:29:13,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:29:13,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33228008] [2025-03-08 00:29:13,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33228008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:29:13,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103940123] [2025-03-08 00:29:13,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:29:13,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:13,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:29:13,532 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:29:13,534 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:29:13,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 00:29:13,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:29:13,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:29:13,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:13,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:29:13,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:29:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 00:29:13,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:29:13,646 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 00:29:13,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103940123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:29:13,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:29:13,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:29:13,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893248131] [2025-03-08 00:29:13,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:29:13,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:29:13,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:29:13,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:29:13,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:29:13,648 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:29:13,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:29:13,660 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2025-03-08 00:29:13,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:29:13,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 35 [2025-03-08 00:29:13,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:29:13,663 INFO L225 Difference]: With dead ends: 47 [2025-03-08 00:29:13,663 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 00:29:13,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:29:13,664 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:29:13,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:29:13,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 00:29:13,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2025-03-08 00:29:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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:29:13,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-03-08 00:29:13,669 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 35 [2025-03-08 00:29:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:29:13,669 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-03-08 00:29:13,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:29:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-03-08 00:29:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 00:29:13,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:13,672 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:13,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:29:13,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:13,872 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:13,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:13,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1378875935, now seen corresponding path program 2 times [2025-03-08 00:29:13,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:13,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649207278] [2025-03-08 00:29:13,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:29:13,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:13,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-08 00:29:13,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:29:13,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:29:13,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 00:29:13,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:29:13,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649207278] [2025-03-08 00:29:13,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649207278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:29:13,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066464685] [2025-03-08 00:29:13,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:29:13,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:13,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:29:13,942 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:29:13,943 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:29:13,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-08 00:29:14,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 00:29:14,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:29:14,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:14,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:29:14,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:29:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 00:29:14,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:29:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 00:29:14,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066464685] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:29:14,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:29:14,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-08 00:29:14,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189091979] [2025-03-08 00:29:14,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:29:14,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:29:14,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:29:14,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:29:14,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:29:14,131 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:29:14,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:29:14,166 INFO L93 Difference]: Finished difference Result 62 states and 87 transitions. [2025-03-08 00:29:14,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:29:14,166 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 38 [2025-03-08 00:29:14,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:29:14,166 INFO L225 Difference]: With dead ends: 62 [2025-03-08 00:29:14,166 INFO L226 Difference]: Without dead ends: 42 [2025-03-08 00:29:14,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:29:14,167 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:29:14,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 107 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:29:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-08 00:29:14,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2025-03-08 00:29:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 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:29:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-08 00:29:14,171 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 38 [2025-03-08 00:29:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:29:14,171 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-08 00:29:14,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:29:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-08 00:29:14,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 00:29:14,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:14,172 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:14,178 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:29:14,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:14,372 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:14,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:14,373 INFO L85 PathProgramCache]: Analyzing trace with hash 643229862, now seen corresponding path program 3 times [2025-03-08 00:29:14,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:14,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688481254] [2025-03-08 00:29:14,373 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:29:14,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:14,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 6 equivalence classes. [2025-03-08 00:29:14,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 53 statements. [2025-03-08 00:29:14,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:29:14,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-08 00:29:14,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:29:14,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688481254] [2025-03-08 00:29:14,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688481254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:29:14,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956670204] [2025-03-08 00:29:14,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:29:14,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:14,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:29:14,454 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:29:14,456 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:29:14,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 6 equivalence classes. [2025-03-08 00:29:14,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 32 of 53 statements. [2025-03-08 00:29:14,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:29:14,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:14,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 00:29:14,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:29:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 40 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-08 00:29:14,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:29:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-08 00:29:14,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956670204] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:29:14,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:29:14,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 00:29:14,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232497621] [2025-03-08 00:29:14,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:29:14,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 00:29:14,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:29:14,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 00:29:14,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:29:14,563 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:29:14,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:29:14,582 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2025-03-08 00:29:14,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:29:14,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2025-03-08 00:29:14,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:29:14,583 INFO L225 Difference]: With dead ends: 60 [2025-03-08 00:29:14,583 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 00:29:14,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 00:29:14,583 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:29:14,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:29:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 00:29:14,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-08 00:29:14,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:29:14,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2025-03-08 00:29:14,587 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 53 [2025-03-08 00:29:14,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:29:14,588 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2025-03-08 00:29:14,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:29:14,588 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2025-03-08 00:29:14,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 00:29:14,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:14,589 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:14,595 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:29:14,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:14,793 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:14,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:14,793 INFO L85 PathProgramCache]: Analyzing trace with hash -808896938, now seen corresponding path program 4 times [2025-03-08 00:29:14,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:14,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283248501] [2025-03-08 00:29:14,794 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:29:14,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:14,810 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-08 00:29:14,820 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:29:14,820 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:29:14,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-08 00:29:14,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:29:14,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283248501] [2025-03-08 00:29:14,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283248501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:29:14,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957183839] [2025-03-08 00:29:14,886 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:29:14,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:14,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:29:14,887 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:29:14,889 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:29:14,939 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 56 statements into 2 equivalence classes. [2025-03-08 00:29:14,978 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:29:14,978 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:29:14,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:14,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:29:14,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:29:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-08 00:29:14,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:29:15,045 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-08 00:29:15,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957183839] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:29:15,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:29:15,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 00:29:15,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857081039] [2025-03-08 00:29:15,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:29:15,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 00:29:15,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:29:15,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 00:29:15,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:29:15,049 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:29:15,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:29:15,087 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2025-03-08 00:29:15,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:29:15,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-03-08 00:29:15,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:29:15,091 INFO L225 Difference]: With dead ends: 88 [2025-03-08 00:29:15,091 INFO L226 Difference]: Without dead ends: 61 [2025-03-08 00:29:15,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-08 00:29:15,092 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 40 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:29:15,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 98 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:29:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-08 00:29:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-08 00:29:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:29:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2025-03-08 00:29:15,099 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 56 [2025-03-08 00:29:15,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:29:15,099 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2025-03-08 00:29:15,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:29:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2025-03-08 00:29:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 00:29:15,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:15,102 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 10, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:15,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 00:29:15,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:15,303 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:15,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:15,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1207595030, now seen corresponding path program 5 times [2025-03-08 00:29:15,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:15,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046543341] [2025-03-08 00:29:15,304 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:29:15,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:15,324 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 92 statements into 14 equivalence classes. [2025-03-08 00:29:15,372 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 81 of 92 statements. [2025-03-08 00:29:15,372 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-08 00:29:15,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:15,544 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 123 proven. 174 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-03-08 00:29:15,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:29:15,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046543341] [2025-03-08 00:29:15,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046543341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:29:15,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680641917] [2025-03-08 00:29:15,545 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:29:15,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:15,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:29:15,548 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:29:15,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:29:15,606 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 92 statements into 14 equivalence classes. [2025-03-08 00:29:15,785 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 81 of 92 statements. [2025-03-08 00:29:15,785 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-08 00:29:15,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:15,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:29:15,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:29:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 244 proven. 51 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-08 00:29:15,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:29:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-03-08 00:29:15,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680641917] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:29:15,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:29:15,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-08 00:29:15,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685409398] [2025-03-08 00:29:15,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:29:15,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:29:15,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:29:15,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:29:15,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:29:15,910 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:29:15,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:29:15,965 INFO L93 Difference]: Finished difference Result 148 states and 205 transitions. [2025-03-08 00:29:15,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:29:15,966 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 92 [2025-03-08 00:29:15,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:29:15,966 INFO L225 Difference]: With dead ends: 148 [2025-03-08 00:29:15,966 INFO L226 Difference]: Without dead ends: 101 [2025-03-08 00:29:15,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:29:15,967 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 184 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:29:15,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 112 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:29:15,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-08 00:29:15,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-08 00:29:15,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 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:29:15,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 133 transitions. [2025-03-08 00:29:15,974 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 133 transitions. Word has length 92 [2025-03-08 00:29:15,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:29:15,974 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 133 transitions. [2025-03-08 00:29:15,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 00:29:15,974 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 133 transitions. [2025-03-08 00:29:15,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-08 00:29:15,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:15,975 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 10, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:15,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 00:29:16,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:16,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:16,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:16,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1392591766, now seen corresponding path program 6 times [2025-03-08 00:29:16,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:16,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324653281] [2025-03-08 00:29:16,176 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:29:16,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:16,191 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 164 statements into 30 equivalence classes. [2025-03-08 00:29:16,230 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 52 of 164 statements. [2025-03-08 00:29:16,230 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:29:16,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:16,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:29:16,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:29:16,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324653281] [2025-03-08 00:29:16,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324653281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:29:16,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434436812] [2025-03-08 00:29:16,317 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:29:16,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:16,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:29:16,319 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:29:16,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:29:16,392 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 164 statements into 30 equivalence classes. [2025-03-08 00:29:16,454 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 52 of 164 statements. [2025-03-08 00:29:16,454 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-08 00:29:16,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:16,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:29:16,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:29:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 1240 proven. 10 refuted. 0 times theorem prover too weak. 1536 trivial. 0 not checked. [2025-03-08 00:29:16,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:29:16,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:29:16,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434436812] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:29:16,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:29:16,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-08 00:29:16,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024009338] [2025-03-08 00:29:16,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:29:16,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:29:16,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:29:16,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:29:16,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:29:16,529 INFO L87 Difference]: Start difference. First operand 101 states and 133 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:29:16,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:29:16,549 INFO L93 Difference]: Finished difference Result 186 states and 252 transitions. [2025-03-08 00:29:16,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:29:16,550 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 164 [2025-03-08 00:29:16,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:29:16,551 INFO L225 Difference]: With dead ends: 186 [2025-03-08 00:29:16,551 INFO L226 Difference]: Without dead ends: 107 [2025-03-08 00:29:16,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:29:16,555 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:29:16,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:29:16,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-08 00:29:16,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-08 00:29:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 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:29:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2025-03-08 00:29:16,569 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 139 transitions. Word has length 164 [2025-03-08 00:29:16,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:29:16,569 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 139 transitions. [2025-03-08 00:29:16,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:29:16,569 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 139 transitions. [2025-03-08 00:29:16,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 00:29:16,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:16,571 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 10, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:16,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 00:29:16,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 00:29:16,771 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:16,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:16,772 INFO L85 PathProgramCache]: Analyzing trace with hash 901177750, now seen corresponding path program 7 times [2025-03-08 00:29:16,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:16,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912928615] [2025-03-08 00:29:16,772 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:29:16,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:16,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 00:29:16,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 00:29:16,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:29:16,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:29:17,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:29:17,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912928615] [2025-03-08 00:29:17,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912928615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:29:17,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628607827] [2025-03-08 00:29:17,103 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:29:17,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:17,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:29:17,105 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:29:17,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:29:17,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 00:29:17,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 00:29:17,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:29:17,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:17,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:29:17,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:29:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:29:17,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:29:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:29:17,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628607827] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:29:17,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:29:17,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-08 00:29:17,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328351431] [2025-03-08 00:29:17,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:29:17,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 00:29:17,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:29:17,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 00:29:17,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:29:17,468 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. Second operand has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:29:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:29:17,499 INFO L93 Difference]: Finished difference Result 213 states and 288 transitions. [2025-03-08 00:29:17,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:29:17,499 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 170 [2025-03-08 00:29:17,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:29:17,500 INFO L225 Difference]: With dead ends: 213 [2025-03-08 00:29:17,500 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 00:29:17,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:29:17,502 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:29:17,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:29:17,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 00:29:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-08 00:29:17,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.2719298245614035) internal successors, (145), 114 states have internal predecessors, (145), 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:29:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 151 transitions. [2025-03-08 00:29:17,510 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 151 transitions. Word has length 170 [2025-03-08 00:29:17,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:29:17,510 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 151 transitions. [2025-03-08 00:29:17,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:29:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 151 transitions. [2025-03-08 00:29:17,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 00:29:17,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:17,512 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 22, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:17,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 00:29:17,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:29:17,712 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:17,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:17,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1197238634, now seen corresponding path program 8 times [2025-03-08 00:29:17,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:17,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470160106] [2025-03-08 00:29:17,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:29:17,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:17,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 182 statements into 2 equivalence classes. [2025-03-08 00:29:17,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 00:29:17,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:29:17,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3029 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:29:18,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:29:18,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470160106] [2025-03-08 00:29:18,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470160106] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:29:18,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896669555] [2025-03-08 00:29:18,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:29:18,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:18,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:29:18,425 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:29:18,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:29:18,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 182 statements into 2 equivalence classes. [2025-03-08 00:29:18,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 00:29:18,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:29:18,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:18,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 00:29:18,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:29:18,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3029 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:29:18,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:29:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3029 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-08 00:29:19,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896669555] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:29:19,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:29:19,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-03-08 00:29:19,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111863149] [2025-03-08 00:29:19,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:29:19,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-08 00:29:19,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:29:19,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-08 00:29:19,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 00:29:19,258 INFO L87 Difference]: Start difference. First operand 119 states and 151 transitions. Second operand has 49 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:29:19,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:29:19,305 INFO L93 Difference]: Finished difference Result 237 states and 324 transitions. [2025-03-08 00:29:19,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-08 00:29:19,305 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 182 [2025-03-08 00:29:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:29:19,306 INFO L225 Difference]: With dead ends: 237 [2025-03-08 00:29:19,306 INFO L226 Difference]: Without dead ends: 143 [2025-03-08 00:29:19,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 00:29:19,308 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:29:19,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:29:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-08 00:29:19,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-08 00:29:19,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.2246376811594204) internal successors, (169), 138 states have internal predecessors, (169), 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:29:19,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 175 transitions. [2025-03-08 00:29:19,314 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 175 transitions. Word has length 182 [2025-03-08 00:29:19,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:29:19,314 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 175 transitions. [2025-03-08 00:29:19,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-08 00:29:19,315 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 175 transitions. [2025-03-08 00:29:19,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 00:29:19,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:19,316 INFO L218 NwaCegarLoop]: trace histogram [46, 42, 42, 42, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:19,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 00:29:19,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 00:29:19,517 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:19,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:19,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2105114474, now seen corresponding path program 9 times [2025-03-08 00:29:19,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:19,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944901393] [2025-03-08 00:29:19,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:29:19,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:19,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 206 statements into 30 equivalence classes. [2025-03-08 00:29:19,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 73 of 206 statements. [2025-03-08 00:29:19,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:29:19,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3857 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3802 trivial. 0 not checked. [2025-03-08 00:29:19,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:29:19,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944901393] [2025-03-08 00:29:19,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944901393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:29:19,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239447507] [2025-03-08 00:29:19,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:29:19,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:19,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:29:19,765 INFO L229 MonitoredProcess]: Starting monitored process 12 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:29:19,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 00:29:19,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 206 statements into 30 equivalence classes. [2025-03-08 00:29:20,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 73 of 206 statements. [2025-03-08 00:29:20,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:29:20,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:20,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:29:20,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:29:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3857 backedges. 1240 proven. 55 refuted. 0 times theorem prover too weak. 2562 trivial. 0 not checked. [2025-03-08 00:29:20,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:29:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3857 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3802 trivial. 0 not checked. [2025-03-08 00:29:20,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239447507] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:29:20,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:29:20,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-08 00:29:20,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272090179] [2025-03-08 00:29:20,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:29:20,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 00:29:20,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:29:20,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 00:29:20,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:29:20,604 INFO L87 Difference]: Start difference. First operand 143 states and 175 transitions. Second operand has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:29:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:29:20,636 INFO L93 Difference]: Finished difference Result 234 states and 306 transitions. [2025-03-08 00:29:20,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:29:20,637 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 206 [2025-03-08 00:29:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:29:20,637 INFO L225 Difference]: With dead ends: 234 [2025-03-08 00:29:20,638 INFO L226 Difference]: Without dead ends: 155 [2025-03-08 00:29:20,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:29:20,638 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:29:20,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:29:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-08 00:29:20,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-03-08 00:29:20,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.2066666666666668) internal successors, (181), 150 states have internal predecessors, (181), 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:29:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 187 transitions. [2025-03-08 00:29:20,652 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 187 transitions. Word has length 206 [2025-03-08 00:29:20,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:29:20,652 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 187 transitions. [2025-03-08 00:29:20,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:29:20,653 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 187 transitions. [2025-03-08 00:29:20,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-08 00:29:20,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:20,654 INFO L218 NwaCegarLoop]: trace histogram [46, 42, 42, 42, 22, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:20,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 00:29:20,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 00:29:20,855 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:20,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:20,855 INFO L85 PathProgramCache]: Analyzing trace with hash -573588330, now seen corresponding path program 10 times [2025-03-08 00:29:20,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:20,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885847849] [2025-03-08 00:29:20,855 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:29:20,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:20,884 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 218 statements into 2 equivalence classes. [2025-03-08 00:29:20,909 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 00:29:20,909 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:29:20,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4055 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2025-03-08 00:29:21,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:29:21,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885847849] [2025-03-08 00:29:21,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885847849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:29:21,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250647064] [2025-03-08 00:29:21,320 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:29:21,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:21,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:29:21,324 INFO L229 MonitoredProcess]: Starting monitored process 13 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:29:21,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 00:29:21,445 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 218 statements into 2 equivalence classes. [2025-03-08 00:29:21,539 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 00:29:21,539 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:29:21,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:21,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:29:21,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:29:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4055 backedges. 1236 proven. 287 refuted. 0 times theorem prover too weak. 2532 trivial. 0 not checked. [2025-03-08 00:29:21,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:29:21,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4055 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2025-03-08 00:29:21,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250647064] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:29:21,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:29:21,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2025-03-08 00:29:21,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571372877] [2025-03-08 00:29:21,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:29:21,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 00:29:21,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:29:21,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 00:29:21,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:29:21,898 INFO L87 Difference]: Start difference. First operand 155 states and 187 transitions. Second operand has 32 states, 32 states have (on average 3.46875) internal successors, (111), 32 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:29:22,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:29:22,026 INFO L93 Difference]: Finished difference Result 340 states and 453 transitions. [2025-03-08 00:29:22,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-08 00:29:22,027 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.46875) internal successors, (111), 32 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 218 [2025-03-08 00:29:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:29:22,029 INFO L225 Difference]: With dead ends: 340 [2025-03-08 00:29:22,029 INFO L226 Difference]: Without dead ends: 235 [2025-03-08 00:29:22,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:29:22,030 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 280 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:29:22,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 266 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:29:22,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-08 00:29:22,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-03-08 00:29:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 230 states have (on average 1.2739130434782608) internal successors, (293), 230 states have internal predecessors, (293), 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:29:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 299 transitions. [2025-03-08 00:29:22,042 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 299 transitions. Word has length 218 [2025-03-08 00:29:22,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:29:22,043 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 299 transitions. [2025-03-08 00:29:22,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.46875) internal successors, (111), 32 states have internal predecessors, (111), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 00:29:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 299 transitions. [2025-03-08 00:29:22,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-08 00:29:22,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:29:22,048 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 46, 22, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:29:22,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 00:29:22,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 00:29:22,248 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:29:22,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:29:22,249 INFO L85 PathProgramCache]: Analyzing trace with hash -416816234, now seen corresponding path program 11 times [2025-03-08 00:29:22,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:29:22,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234256528] [2025-03-08 00:29:22,249 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:29:22,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:29:22,287 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 362 statements into 62 equivalence classes. [2025-03-08 00:29:22,698 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) and asserted 351 of 362 statements. [2025-03-08 00:29:22,699 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2025-03-08 00:29:22,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:29:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 13631 backedges. 2763 proven. 4098 refuted. 0 times theorem prover too weak. 6770 trivial. 0 not checked. [2025-03-08 00:29:23,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:29:23,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234256528] [2025-03-08 00:29:23,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234256528] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:29:23,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454472560] [2025-03-08 00:29:23,722 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:29:23,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:29:23,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:29:23,726 INFO L229 MonitoredProcess]: Starting monitored process 14 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:29:23,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 00:29:23,878 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 362 statements into 62 equivalence classes.