./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/copy-partial-2-n-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/copy-partial-2-n-u.c -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 2a46b64c20324a7544dfe7936b5f39eaa32bba659068797748195a7f292bdaee --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:25:28,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:25:28,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:25:28,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:25:28,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:25:28,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:25:28,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:25:28,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:25:28,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:25:28,589 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:25:28,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:25:28,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:25:28,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:25:28,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:25:28,590 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:25:28,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:25:28,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:25:28,590 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:25:28,590 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:25:28,590 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:25:28,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:25:28,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:25:28,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:25:28,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:25:28,591 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:25:28,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:25:28,591 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:25:28,591 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:25:28,591 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:25:28,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:25:28,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:25:28,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:25:28,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:25:28,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:25:28,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:25:28,591 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:25:28,592 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:25:28,592 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:25:28,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:25:28,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:25:28,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:25:28,592 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:25:28,592 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:25:28,592 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 -> 2a46b64c20324a7544dfe7936b5f39eaa32bba659068797748195a7f292bdaee [2025-03-03 09:25:28,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:25:28,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:25:28,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:25:28,813 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:25:28,813 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:25:28,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/copy-partial-2-n-u.c [2025-03-03 09:25:29,888 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627097209/134a0c8ceb97458f977d44e0ac473c54/FLAG9b3adb1b4 [2025-03-03 09:25:30,092 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:25:30,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-partial-2-n-u.c [2025-03-03 09:25:30,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627097209/134a0c8ceb97458f977d44e0ac473c54/FLAG9b3adb1b4 [2025-03-03 09:25:30,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627097209/134a0c8ceb97458f977d44e0ac473c54 [2025-03-03 09:25:30,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:25:30,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:25:30,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:25:30,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:25:30,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:25:30,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:25:30" (1/1) ... [2025-03-03 09:25:30,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dac6d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:30, skipping insertion in model container [2025-03-03 09:25:30,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:25:30" (1/1) ... [2025-03-03 09:25:30,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:25:30,566 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-multidimensional/copy-partial-2-n-u.c[416,429] [2025-03-03 09:25:30,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:25:30,595 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:25:30,603 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-multidimensional/copy-partial-2-n-u.c[416,429] [2025-03-03 09:25:30,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:25:30,628 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:25:30,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:30 WrapperNode [2025-03-03 09:25:30,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:25:30,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:25:30,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:25:30,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:25:30,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:30" (1/1) ... [2025-03-03 09:25:30,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:30" (1/1) ... [2025-03-03 09:25:30,652 INFO L138 Inliner]: procedures = 15, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 68 [2025-03-03 09:25:30,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:25:30,654 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:25:30,654 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:25:30,654 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:25:30,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:30" (1/1) ... [2025-03-03 09:25:30,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:30" (1/1) ... [2025-03-03 09:25:30,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:30" (1/1) ... [2025-03-03 09:25:30,673 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-03 09:25:30,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:30" (1/1) ... [2025-03-03 09:25:30,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:30" (1/1) ... [2025-03-03 09:25:30,677 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:30" (1/1) ... [2025-03-03 09:25:30,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:30" (1/1) ... [2025-03-03 09:25:30,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:30" (1/1) ... [2025-03-03 09:25:30,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:30" (1/1) ... [2025-03-03 09:25:30,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:25:30,680 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:25:30,680 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:25:30,680 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:25:30,681 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:30" (1/1) ... [2025-03-03 09:25:30,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:25:30,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:25:30,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:25:30,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:25:30,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:25:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 09:25:30,724 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 09:25:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:25:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:25:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:25:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:25:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:25:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:25:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:25:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:25:30,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:25:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:25:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:25:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:25:30,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:25:30,769 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:25:30,770 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:25:30,876 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset;call ULTIMATE.dealloc(main_~#B~0#1.base, main_~#B~0#1.offset);havoc main_~#B~0#1.base, main_~#B~0#1.offset; [2025-03-03 09:25:30,883 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-03 09:25:30,883 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:25:30,888 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:25:30,888 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:25:30,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:25:30 BoogieIcfgContainer [2025-03-03 09:25:30,889 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:25:30,890 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:25:30,890 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:25:30,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:25:30,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:25:30" (1/3) ... [2025-03-03 09:25:30,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3038482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:25:30, skipping insertion in model container [2025-03-03 09:25:30,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:25:30" (2/3) ... [2025-03-03 09:25:30,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3038482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:25:30, skipping insertion in model container [2025-03-03 09:25:30,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:25:30" (3/3) ... [2025-03-03 09:25:30,895 INFO L128 eAbstractionObserver]: Analyzing ICFG copy-partial-2-n-u.c [2025-03-03 09:25:30,906 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:25:30,907 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG copy-partial-2-n-u.c that has 2 procedures, 22 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-03 09:25:30,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:25:30,953 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;@7bd2e54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:25:30,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:25:30,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:25:30,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 09:25:30,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:25:30,960 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:25:30,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:25:30,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:25:30,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1349856055, now seen corresponding path program 1 times [2025-03-03 09:25:30,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:25:30,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139984375] [2025-03-03 09:25:30,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:25:30,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:25:31,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 09:25:31,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:25:31,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:25:31,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 09:25:31,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:25:31,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139984375] [2025-03-03 09:25:31,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139984375] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:25:31,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425847194] [2025-03-03 09:25:31,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:25:31,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:25:31,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:25:31,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:25:31,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:25:31,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 09:25:31,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:25:31,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:25:31,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:31,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 09:25:31,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:25:31,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 09:25:31,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:25:31,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425847194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:25:31,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:25:31,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 09:25:31,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603924500] [2025-03-03 09:25:31,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:25:31,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:25:31,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:25:31,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:25:31,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:25:31,207 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:25:31,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:25:31,220 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2025-03-03 09:25:31,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:25:31,222 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2025-03-03 09:25:31,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:25:31,226 INFO L225 Difference]: With dead ends: 41 [2025-03-03 09:25:31,227 INFO L226 Difference]: Without dead ends: 19 [2025-03-03 09:25:31,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:25:31,232 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:25:31,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:25:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-03 09:25:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-03 09:25:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:25:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2025-03-03 09:25:31,259 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 19 [2025-03-03 09:25:31,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:25:31,259 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-03-03 09:25:31,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:25:31,260 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2025-03-03 09:25:31,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 09:25:31,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:25:31,261 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:25:31,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:25:31,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 09:25:31,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:25:31,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:25:31,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1634072937, now seen corresponding path program 1 times [2025-03-03 09:25:31,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:25:31,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720925001] [2025-03-03 09:25:31,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:25:31,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:25:31,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 09:25:31,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:25:31,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:25:31,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:31,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:25:31,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:25:31,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720925001] [2025-03-03 09:25:31,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720925001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:25:31,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:25:31,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:25:31,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836983384] [2025-03-03 09:25:31,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:25:31,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:25:31,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:25:31,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:25:31,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:25:31,623 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 09:25:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:25:31,656 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2025-03-03 09:25:31,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:25:31,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-03 09:25:31,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:25:31,657 INFO L225 Difference]: With dead ends: 29 [2025-03-03 09:25:31,658 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 09:25:31,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:25:31,658 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:25:31,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:25:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 09:25:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-03-03 09:25:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:25:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2025-03-03 09:25:31,662 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 19 [2025-03-03 09:25:31,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:25:31,663 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2025-03-03 09:25:31,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 09:25:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2025-03-03 09:25:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 09:25:31,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:25:31,664 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:25:31,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:25:31,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:25:31,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:25:31,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1459929131, now seen corresponding path program 1 times [2025-03-03 09:25:31,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:25:31,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057394376] [2025-03-03 09:25:31,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:25:31,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:25:31,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-03 09:25:31,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:25:31,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:25:31,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:31,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:25:31,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:25:31,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057394376] [2025-03-03 09:25:31,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057394376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:25:31,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:25:31,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:25:31,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570741218] [2025-03-03 09:25:31,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:25:31,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:25:31,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:25:31,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:25:31,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:25:31,779 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 09:25:31,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:25:31,815 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2025-03-03 09:25:31,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:25:31,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-03 09:25:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:25:31,816 INFO L225 Difference]: With dead ends: 37 [2025-03-03 09:25:31,816 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 09:25:31,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:25:31,816 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 21 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:25:31,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 36 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:25:31,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 09:25:31,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2025-03-03 09:25:31,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:25:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2025-03-03 09:25:31,822 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 21 [2025-03-03 09:25:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:25:31,822 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2025-03-03 09:25:31,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 09:25:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2025-03-03 09:25:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 09:25:31,823 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:25:31,823 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:25:31,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:25:31,823 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:25:31,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:25:31,825 INFO L85 PathProgramCache]: Analyzing trace with hash 437655796, now seen corresponding path program 1 times [2025-03-03 09:25:31,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:25:31,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533545464] [2025-03-03 09:25:31,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:25:31,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:25:31,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-03 09:25:31,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 09:25:31,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:25:31,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:25:31,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:25:31,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533545464] [2025-03-03 09:25:31,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533545464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:25:31,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:25:31,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:25:31,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085512691] [2025-03-03 09:25:31,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:25:31,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:25:31,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:25:31,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:25:31,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:25:31,898 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 09:25:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:25:31,934 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2025-03-03 09:25:31,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:25:31,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-03 09:25:31,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:25:31,935 INFO L225 Difference]: With dead ends: 37 [2025-03-03 09:25:31,935 INFO L226 Difference]: Without dead ends: 31 [2025-03-03 09:25:31,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:25:31,936 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 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-03 09:25:31,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:25:31,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-03 09:25:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2025-03-03 09:25:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:25:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-03-03 09:25:31,943 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 22 [2025-03-03 09:25:31,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:25:31,944 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-03 09:25:31,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 09:25:31,944 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-03-03 09:25:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:25:31,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:25:31,944 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:25:31,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:25:31,944 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:25:31,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:25:31,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1892833290, now seen corresponding path program 1 times [2025-03-03 09:25:31,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:25:31,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610823259] [2025-03-03 09:25:31,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:25:31,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:25:31,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:25:31,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:25:31,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:25:31,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:25:32,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:25:32,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610823259] [2025-03-03 09:25:32,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610823259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:25:32,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:25:32,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:25:32,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464445395] [2025-03-03 09:25:32,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:25:32,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:25:32,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:25:32,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:25:32,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:25:32,030 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 09:25:32,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:25:32,062 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2025-03-03 09:25:32,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:25:32,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-03 09:25:32,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:25:32,066 INFO L225 Difference]: With dead ends: 36 [2025-03-03 09:25:32,066 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 09:25:32,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:25:32,066 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:25:32,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 31 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:25:32,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 09:25:32,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2025-03-03 09:25:32,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:25:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-03-03 09:25:32,071 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 24 [2025-03-03 09:25:32,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:25:32,071 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-03-03 09:25:32,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-03 09:25:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-03-03 09:25:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:25:32,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:25:32,073 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:25:32,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:25:32,074 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:25:32,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:25:32,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1926169033, now seen corresponding path program 1 times [2025-03-03 09:25:32,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:25:32,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801588699] [2025-03-03 09:25:32,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:25:32,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:25:32,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:25:32,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:25:32,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:25:32,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:32,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:25:32,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:25:32,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801588699] [2025-03-03 09:25:32,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801588699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:25:32,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564095935] [2025-03-03 09:25:32,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:25:32,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:25:32,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:25:32,144 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:25:32,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:25:32,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:25:32,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:25:32,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:25:32,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:32,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:25:32,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:25:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:25:32,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:25:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:25:32,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564095935] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:25:32,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:25:32,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-03 09:25:32,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711485097] [2025-03-03 09:25:32,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:25:32,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:25:32,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:25:32,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:25:32,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:25:32,298 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:25:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:25:32,368 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2025-03-03 09:25:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:25:32,368 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-03 09:25:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:25:32,369 INFO L225 Difference]: With dead ends: 63 [2025-03-03 09:25:32,369 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 09:25:32,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:25:32,371 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 120 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:25:32,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 48 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:25:32,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 09:25:32,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2025-03-03 09:25:32,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:25:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-03-03 09:25:32,381 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 25 [2025-03-03 09:25:32,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:25:32,381 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-03-03 09:25:32,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:25:32,381 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-03-03 09:25:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 09:25:32,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:25:32,381 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:25:32,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:25:32,586 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,SelfDestructingSolverStorable5 [2025-03-03 09:25:32,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:25:32,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:25:32,586 INFO L85 PathProgramCache]: Analyzing trace with hash -900958218, now seen corresponding path program 2 times [2025-03-03 09:25:32,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:25:32,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055007960] [2025-03-03 09:25:32,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:25:32,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:25:32,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-03 09:25:32,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:25:32,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:25:32,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:25:32,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:25:32,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055007960] [2025-03-03 09:25:32,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055007960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:25:32,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666292468] [2025-03-03 09:25:32,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:25:32,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:25:32,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:25:32,683 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:25:32,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:25:32,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-03 09:25:32,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:25:32,737 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:25:32,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:32,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:25:32,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:25:32,784 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:25:32,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:25:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 09:25:32,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666292468] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:25:32,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:25:32,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-03 09:25:32,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926775325] [2025-03-03 09:25:32,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:25:32,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:25:32,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:25:32,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:25:32,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:25:32,830 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:25:32,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:25:32,895 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2025-03-03 09:25:32,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:25:32,895 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2025-03-03 09:25:32,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:25:32,896 INFO L225 Difference]: With dead ends: 56 [2025-03-03 09:25:32,896 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 09:25:32,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:25:32,899 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 24 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:25:32,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 68 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:25:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 09:25:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-03 09:25:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:25:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2025-03-03 09:25:32,913 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 28 [2025-03-03 09:25:32,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:25:32,913 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2025-03-03 09:25:32,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:25:32,913 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2025-03-03 09:25:32,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-03 09:25:32,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:25:32,914 INFO L218 NwaCegarLoop]: trace histogram [16, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:25:32,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 09:25:33,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:25:33,115 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:25:33,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:25:33,115 INFO L85 PathProgramCache]: Analyzing trace with hash -553195076, now seen corresponding path program 3 times [2025-03-03 09:25:33,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:25:33,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069070130] [2025-03-03 09:25:33,115 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:25:33,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:25:33,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 13 equivalence classes. [2025-03-03 09:25:33,143 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 46 statements. [2025-03-03 09:25:33,143 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:25:33,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-03 09:25:33,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:25:33,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069070130] [2025-03-03 09:25:33,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069070130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:25:33,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992820049] [2025-03-03 09:25:33,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:25:33,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:25:33,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:25:33,184 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-03 09:25:33,185 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-03 09:25:33,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 13 equivalence classes. [2025-03-03 09:25:33,241 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 46 statements. [2025-03-03 09:25:33,241 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:25:33,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:33,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:25:33,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:25:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-03 09:25:33,300 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:25:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-03 09:25:33,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992820049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:25:33,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:25:33,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-03 09:25:33,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111299159] [2025-03-03 09:25:33,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:25:33,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:25:33,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:25:33,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:25:33,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:25:33,367 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:25:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:25:33,467 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2025-03-03 09:25:33,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:25:33,468 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2025-03-03 09:25:33,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:25:33,468 INFO L225 Difference]: With dead ends: 88 [2025-03-03 09:25:33,468 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 09:25:33,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:25:33,469 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 142 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:25:33,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 49 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:25:33,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 09:25:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 54. [2025-03-03 09:25:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:25:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2025-03-03 09:25:33,478 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 46 [2025-03-03 09:25:33,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:25:33,478 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2025-03-03 09:25:33,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:25:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2025-03-03 09:25:33,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 09:25:33,479 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:25:33,479 INFO L218 NwaCegarLoop]: trace histogram [16, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:25:33,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:25:33,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:25:33,680 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:25:33,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:25:33,680 INFO L85 PathProgramCache]: Analyzing trace with hash -985356977, now seen corresponding path program 4 times [2025-03-03 09:25:33,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:25:33,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27631159] [2025-03-03 09:25:33,681 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:25:33,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:25:33,693 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-03-03 09:25:33,700 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 55 statements. [2025-03-03 09:25:33,700 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:25:33,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 23 proven. 174 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 09:25:33,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:25:33,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27631159] [2025-03-03 09:25:33,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27631159] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:25:33,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814531207] [2025-03-03 09:25:33,870 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:25:33,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:25:33,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:25:33,872 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-03 09:25:33,873 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-03 09:25:33,924 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-03-03 09:25:33,937 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 37 of 55 statements. [2025-03-03 09:25:33,937 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:25:33,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:33,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 09:25:33,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:25:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 34 proven. 163 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 09:25:34,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:25:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 34 proven. 163 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 09:25:34,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814531207] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:25:34,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:25:34,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2025-03-03 09:25:34,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160530509] [2025-03-03 09:25:34,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:25:34,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 09:25:34,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:25:34,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 09:25:34,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=723, Unknown=0, NotChecked=0, Total=930 [2025-03-03 09:25:34,443 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 09:25:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:25:34,615 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2025-03-03 09:25:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 09:25:34,615 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 55 [2025-03-03 09:25:34,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:25:34,616 INFO L225 Difference]: With dead ends: 87 [2025-03-03 09:25:34,616 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 09:25:34,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=833, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 09:25:34,617 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:25:34,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 116 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:25:34,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 09:25:34,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2025-03-03 09:25:34,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 56 states have internal predecessors, (69), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:25:34,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2025-03-03 09:25:34,627 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 55 [2025-03-03 09:25:34,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:25:34,627 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2025-03-03 09:25:34,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.6451612903225805) internal successors, (82), 29 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 09:25:34,627 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2025-03-03 09:25:34,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-03 09:25:34,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:25:34,628 INFO L218 NwaCegarLoop]: trace histogram [20, 5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:25:34,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:25:34,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:25:34,828 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:25:34,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:25:34,829 INFO L85 PathProgramCache]: Analyzing trace with hash -733837491, now seen corresponding path program 5 times [2025-03-03 09:25:34,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:25:34,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117117284] [2025-03-03 09:25:34,829 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:25:34,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:25:34,843 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 61 statements into 16 equivalence classes. [2025-03-03 09:25:34,910 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 09:25:34,910 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2025-03-03 09:25:34,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:25:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 159 proven. 60 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-03 09:25:35,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:25:35,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117117284] [2025-03-03 09:25:35,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117117284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:25:35,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199504035] [2025-03-03 09:25:35,026 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:25:35,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:25:35,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:25:35,028 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-03 09:25:35,029 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-03 09:25:35,085 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 61 statements into 16 equivalence classes. [2025-03-03 09:26:33,923 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) and asserted 61 of 61 statements. [2025-03-03 09:26:33,923 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2025-03-03 09:26:33,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:26:33,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:26:33,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:26:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 209 proven. 10 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-03 09:26:34,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:26:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 159 proven. 60 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2025-03-03 09:26:34,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199504035] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:26:34,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:26:34,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-03 09:26:34,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12487794] [2025-03-03 09:26:34,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:26:34,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 09:26:34,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:26:34,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 09:26:34,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:26:34,095 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:26:34,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:26:34,244 INFO L93 Difference]: Finished difference Result 220 states and 319 transitions. [2025-03-03 09:26:34,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:26:34,245 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 61 [2025-03-03 09:26:34,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:26:34,246 INFO L225 Difference]: With dead ends: 220 [2025-03-03 09:26:34,246 INFO L226 Difference]: Without dead ends: 175 [2025-03-03 09:26:34,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:26:34,248 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 166 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:26:34,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 93 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:26:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-03 09:26:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 90. [2025-03-03 09:26:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 86 states have internal predecessors, (99), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:26:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2025-03-03 09:26:34,271 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 61 [2025-03-03 09:26:34,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:26:34,271 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2025-03-03 09:26:34,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:26:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2025-03-03 09:26:34,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-03 09:26:34,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:26:34,275 INFO L218 NwaCegarLoop]: trace histogram [50, 5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:26:34,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 09:26:34,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:26:34,475 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:26:34,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:26:34,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2109646739, now seen corresponding path program 6 times [2025-03-03 09:26:34,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:26:34,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187665105] [2025-03-03 09:26:34,476 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:26:34,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:26:34,501 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 91 statements into 31 equivalence classes. [2025-03-03 09:26:34,530 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 37 of 91 statements. [2025-03-03 09:26:34,530 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:26:34,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:26:34,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1542 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 1525 trivial. 0 not checked. [2025-03-03 09:26:34,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:26:34,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187665105] [2025-03-03 09:26:34,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187665105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:26:34,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654649905] [2025-03-03 09:26:34,581 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:26:34,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:26:34,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:26:34,583 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-03 09:26:34,585 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-03 09:26:34,665 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 91 statements into 31 equivalence classes. [2025-03-03 09:26:34,708 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 37 of 91 statements. [2025-03-03 09:26:34,708 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:26:34,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:26:34,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:26:34,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:26:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1542 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 1525 trivial. 0 not checked. [2025-03-03 09:26:34,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:26:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1542 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 1525 trivial. 0 not checked. [2025-03-03 09:26:34,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654649905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:26:34,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:26:34,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-03 09:26:34,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94280150] [2025-03-03 09:26:34,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:26:34,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:26:34,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:26:34,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:26:34,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:26:34,885 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:26:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:26:34,968 INFO L93 Difference]: Finished difference Result 134 states and 167 transitions. [2025-03-03 09:26:34,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:26:34,968 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 91 [2025-03-03 09:26:34,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:26:34,970 INFO L225 Difference]: With dead ends: 134 [2025-03-03 09:26:34,970 INFO L226 Difference]: Without dead ends: 117 [2025-03-03 09:26:34,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:26:34,971 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 74 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:26:34,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 46 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:26:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-03 09:26:34,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2025-03-03 09:26:34,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.1495327102803738) internal successors, (123), 107 states have internal predecessors, (123), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:26:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 127 transitions. [2025-03-03 09:26:34,991 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 127 transitions. Word has length 91 [2025-03-03 09:26:34,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:26:34,991 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 127 transitions. [2025-03-03 09:26:34,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:26:34,991 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 127 transitions. [2025-03-03 09:26:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 09:26:34,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:26:34,994 INFO L218 NwaCegarLoop]: trace histogram [50, 16, 5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:26:35,001 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-03 09:26:35,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:26:35,200 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:26:35,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:26:35,200 INFO L85 PathProgramCache]: Analyzing trace with hash -42140491, now seen corresponding path program 7 times [2025-03-03 09:26:35,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:26:35,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312534499] [2025-03-03 09:26:35,201 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:26:35,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:26:35,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 09:26:35,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 09:26:35,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:26:35,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:26:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 489 proven. 55 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2025-03-03 09:26:35,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:26:35,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312534499] [2025-03-03 09:26:35,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312534499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:26:35,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261225061] [2025-03-03 09:26:35,631 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:26:35,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:26:35,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:26:35,633 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-03 09:26:35,634 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-03 09:26:35,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 09:26:35,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 09:26:35,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:26:35,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:26:35,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 09:26:35,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:26:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 489 proven. 55 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2025-03-03 09:26:35,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:26:36,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 489 proven. 55 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2025-03-03 09:26:36,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261225061] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:26:36,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:26:36,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2025-03-03 09:26:36,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153612751] [2025-03-03 09:26:36,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:26:36,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 09:26:36,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:26:36,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 09:26:36,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 09:26:36,159 INFO L87 Difference]: Start difference. First operand 111 states and 127 transitions. Second operand has 37 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:26:36,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:26:36,598 INFO L93 Difference]: Finished difference Result 433 states and 610 transitions. [2025-03-03 09:26:36,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 09:26:36,599 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 103 [2025-03-03 09:26:36,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:26:36,600 INFO L225 Difference]: With dead ends: 433 [2025-03-03 09:26:36,600 INFO L226 Difference]: Without dead ends: 343 [2025-03-03 09:26:36,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=876, Invalid=1380, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 09:26:36,602 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 448 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:26:36,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 150 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:26:36,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-03 09:26:36,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 171. [2025-03-03 09:26:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 167 states have (on average 1.095808383233533) internal successors, (183), 167 states have internal predecessors, (183), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:26:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2025-03-03 09:26:36,640 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 103 [2025-03-03 09:26:36,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:26:36,640 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2025-03-03 09:26:36,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:26:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2025-03-03 09:26:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 09:26:36,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:26:36,644 INFO L218 NwaCegarLoop]: trace histogram [110, 16, 5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:26:36,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 09:26:36,844 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,SelfDestructingSolverStorable11 [2025-03-03 09:26:36,844 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:26:36,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:26:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash -642607371, now seen corresponding path program 8 times [2025-03-03 09:26:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:26:36,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266448033] [2025-03-03 09:26:36,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:26:36,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:26:36,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 163 statements into 2 equivalence classes. [2025-03-03 09:26:36,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 09:26:36,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:26:36,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:26:37,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6774 backedges. 2121 proven. 253 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2025-03-03 09:26:37,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:26:37,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266448033] [2025-03-03 09:26:37,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266448033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:26:37,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403957671] [2025-03-03 09:26:37,915 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:26:37,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:26:37,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:26:37,917 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-03 09:26:37,918 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-03 09:26:38,053 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 163 statements into 2 equivalence classes. [2025-03-03 09:26:38,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 09:26:38,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:26:38,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:26:38,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 09:26:38,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:26:38,526 INFO L134 CoverageAnalysis]: Checked inductivity of 6774 backedges. 2121 proven. 253 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2025-03-03 09:26:38,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:26:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6774 backedges. 2121 proven. 253 refuted. 0 times theorem prover too weak. 4400 trivial. 0 not checked. [2025-03-03 09:26:39,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403957671] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:26:39,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:26:39,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 73 [2025-03-03 09:26:39,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030739752] [2025-03-03 09:26:39,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:26:39,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-03 09:26:39,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:26:39,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-03 09:26:39,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=2949, Unknown=0, NotChecked=0, Total=5256 [2025-03-03 09:26:39,168 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand has 73 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 73 states have internal predecessors, (92), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:26:40,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:26:40,409 INFO L93 Difference]: Finished difference Result 817 states and 1174 transitions. [2025-03-03 09:26:40,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-03 09:26:40,410 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 73 states have internal predecessors, (92), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 163 [2025-03-03 09:26:40,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:26:40,412 INFO L225 Difference]: With dead ends: 817 [2025-03-03 09:26:40,412 INFO L226 Difference]: Without dead ends: 679 [2025-03-03 09:26:40,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3480, Invalid=5640, Unknown=0, NotChecked=0, Total=9120 [2025-03-03 09:26:40,414 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 980 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:26:40,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 234 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:26:40,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-03 09:26:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 291. [2025-03-03 09:26:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 287 states have (on average 1.0557491289198606) internal successors, (303), 287 states have internal predecessors, (303), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:26:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 307 transitions. [2025-03-03 09:26:40,461 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 307 transitions. Word has length 163 [2025-03-03 09:26:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:26:40,461 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 307 transitions. [2025-03-03 09:26:40,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 73 states have internal predecessors, (92), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:26:40,461 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 307 transitions. [2025-03-03 09:26:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-03 09:26:40,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:26:40,463 INFO L218 NwaCegarLoop]: trace histogram [230, 16, 5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:26:40,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 09:26:40,663 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,SelfDestructingSolverStorable12 [2025-03-03 09:26:40,664 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:26:40,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:26:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash 591080309, now seen corresponding path program 9 times [2025-03-03 09:26:40,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:26:40,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600496209] [2025-03-03 09:26:40,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:26:40,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:26:40,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 283 statements into 121 equivalence classes. [2025-03-03 09:26:40,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 43 of 283 statements. [2025-03-03 09:26:40,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 09:26:40,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:26:40,850 INFO L134 CoverageAnalysis]: Checked inductivity of 27714 backedges. 79 proven. 10 refuted. 0 times theorem prover too weak. 27625 trivial. 0 not checked. [2025-03-03 09:26:40,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:26:40,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600496209] [2025-03-03 09:26:40,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600496209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:26:40,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068479053] [2025-03-03 09:26:40,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:26:40,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:26:40,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:26:40,853 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-03 09:26:40,854 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-03 09:26:41,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 283 statements into 121 equivalence classes. [2025-03-03 09:26:41,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 43 of 283 statements. [2025-03-03 09:26:41,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 09:26:41,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:26:41,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:26:41,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:26:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 27714 backedges. 79 proven. 10 refuted. 0 times theorem prover too weak. 27625 trivial. 0 not checked. [2025-03-03 09:26:41,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:26:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 27714 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 27625 trivial. 0 not checked. [2025-03-03 09:26:41,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068479053] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:26:41,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:26:41,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2025-03-03 09:26:41,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236685637] [2025-03-03 09:26:41,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:26:41,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 09:26:41,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:26:41,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 09:26:41,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=195, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:26:41,777 INFO L87 Difference]: Start difference. First operand 291 states and 307 transitions. Second operand has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:26:41,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:26:41,964 INFO L93 Difference]: Finished difference Result 386 states and 437 transitions. [2025-03-03 09:26:41,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:26:41,965 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 283 [2025-03-03 09:26:41,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:26:41,966 INFO L225 Difference]: With dead ends: 386 [2025-03-03 09:26:41,966 INFO L226 Difference]: Without dead ends: 351 [2025-03-03 09:26:41,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=222, Invalid=330, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:26:41,967 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 175 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:26:41,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 85 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:26:41,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-03 09:26:42,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 333. [2025-03-03 09:26:42,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 329 states have (on average 1.0668693009118542) internal successors, (351), 329 states have internal predecessors, (351), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:26:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 355 transitions. [2025-03-03 09:26:42,021 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 355 transitions. Word has length 283 [2025-03-03 09:26:42,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:26:42,021 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 355 transitions. [2025-03-03 09:26:42,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:26:42,021 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 355 transitions. [2025-03-03 09:26:42,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2025-03-03 09:26:42,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:26:42,023 INFO L218 NwaCegarLoop]: trace histogram [230, 40, 5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:26:42,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 09:26:42,223 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,SelfDestructingSolverStorable13 [2025-03-03 09:26:42,224 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:26:42,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:26:42,224 INFO L85 PathProgramCache]: Analyzing trace with hash 817813749, now seen corresponding path program 10 times [2025-03-03 09:26:42,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:26:42,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319408484] [2025-03-03 09:26:42,225 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:26:42,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:26:42,299 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 307 statements into 2 equivalence classes. [2025-03-03 09:26:42,327 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 307 of 307 statements. [2025-03-03 09:26:42,327 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:26:42,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:26:42,773 INFO L134 CoverageAnalysis]: Checked inductivity of 28470 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 27734 trivial. 0 not checked. [2025-03-03 09:26:42,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:26:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319408484] [2025-03-03 09:26:42,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319408484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:26:42,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315667115] [2025-03-03 09:26:42,774 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:26:42,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:26:42,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:26:42,779 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-03 09:26:42,787 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-03 09:26:43,109 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 307 statements into 2 equivalence classes. [2025-03-03 09:26:43,174 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 75 of 307 statements. [2025-03-03 09:26:43,175 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:26:43,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:26:43,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 120 conjuncts are in the unsatisfiable core [2025-03-03 09:26:43,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:26:43,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-03-03 09:26:43,260 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-03 09:26:43,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2025-03-03 09:26:43,338 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-03 09:26:43,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 56 [2025-03-03 09:26:43,433 INFO L349 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2025-03-03 09:26:43,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 78 [2025-03-03 09:26:43,555 INFO L349 Elim1Store]: treesize reduction 156, result has 20.8 percent of original size [2025-03-03 09:26:43,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 100 [2025-03-03 09:26:43,750 INFO L349 Elim1Store]: treesize reduction 216, result has 19.4 percent of original size [2025-03-03 09:26:43,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 111 treesize of output 122 [2025-03-03 09:26:43,964 INFO L349 Elim1Store]: treesize reduction 284, result has 18.2 percent of original size [2025-03-03 09:26:43,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 130 treesize of output 144 [2025-03-03 09:26:44,461 INFO L349 Elim1Store]: treesize reduction 360, result has 17.1 percent of original size [2025-03-03 09:26:44,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 149 treesize of output 166 [2025-03-03 09:26:50,571 INFO L349 Elim1Store]: treesize reduction 444, result has 16.1 percent of original size [2025-03-03 09:26:50,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 168 treesize of output 188 [2025-03-03 09:27:11,167 INFO L349 Elim1Store]: treesize reduction 536, result has 15.2 percent of original size [2025-03-03 09:27:11,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 187 treesize of output 210