./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/eureka_01-2.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/loops/eureka_01-2.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 fc84672deb8568f357f3e53d1889a4a141611ae62422dd83eb7a6bc6f311a8b1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:26:59,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:26:59,680 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:26:59,683 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:26:59,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:26:59,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:26:59,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:26:59,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:26:59,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:26:59,698 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:26:59,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:26:59,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:26:59,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:26:59,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:26:59,700 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:26:59,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:26:59,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:26:59,700 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:26:59,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:26:59,700 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:26:59,700 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:26:59,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:26:59,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:26:59,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:26:59,701 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:26:59,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:26:59,701 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:26:59,701 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:26:59,701 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:26:59,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:26:59,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:26:59,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:26:59,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:26:59,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:26:59,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:26:59,702 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:26:59,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:26:59,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:26:59,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:26:59,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:26:59,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:26:59,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:26:59,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:26:59,703 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 -> fc84672deb8568f357f3e53d1889a4a141611ae62422dd83eb7a6bc6f311a8b1 [2025-03-03 13:26:59,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:26:59,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:26:59,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:26:59,960 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:26:59,961 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:26:59,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/eureka_01-2.c [2025-03-03 13:27:01,151 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a38dc849/cf9b9bc0014e4c74a7dbe4d99a3f2bb7/FLAG341a21daf [2025-03-03 13:27:01,380 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:27:01,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_01-2.c [2025-03-03 13:27:01,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a38dc849/cf9b9bc0014e4c74a7dbe4d99a3f2bb7/FLAG341a21daf [2025-03-03 13:27:01,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a38dc849/cf9b9bc0014e4c74a7dbe4d99a3f2bb7 [2025-03-03 13:27:01,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:27:01,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:27:01,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:27:01,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:27:01,409 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:27:01,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:27:01" (1/1) ... [2025-03-03 13:27:01,410 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d58bc37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:01, skipping insertion in model container [2025-03-03 13:27:01,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:27:01" (1/1) ... [2025-03-03 13:27:01,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:27:01,523 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/loops/eureka_01-2.c[323,336] [2025-03-03 13:27:01,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:27:01,566 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:27:01,574 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/loops/eureka_01-2.c[323,336] [2025-03-03 13:27:01,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:27:01,615 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:27:01,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:01 WrapperNode [2025-03-03 13:27:01,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:27:01,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:27:01,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:27:01,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:27:01,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:01" (1/1) ... [2025-03-03 13:27:01,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:01" (1/1) ... [2025-03-03 13:27:01,655 INFO L138 Inliner]: procedures = 14, calls = 100, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 186 [2025-03-03 13:27:01,656 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:27:01,657 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:27:01,657 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:27:01,657 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:27:01,663 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:01" (1/1) ... [2025-03-03 13:27:01,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:01" (1/1) ... [2025-03-03 13:27:01,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:01" (1/1) ... [2025-03-03 13:27:01,682 INFO L175 MemorySlicer]: Split 81 memory accesses to 5 slices as follows [2, 24, 23, 23, 9]. 30 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 66 writes are split as follows [0, 21, 21, 21, 3]. [2025-03-03 13:27:01,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:01" (1/1) ... [2025-03-03 13:27:01,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:01" (1/1) ... [2025-03-03 13:27:01,691 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:01" (1/1) ... [2025-03-03 13:27:01,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:01" (1/1) ... [2025-03-03 13:27:01,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:01" (1/1) ... [2025-03-03 13:27:01,700 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:01" (1/1) ... [2025-03-03 13:27:01,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:27:01,703 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:27:01,703 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:27:01,703 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:27:01,704 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:01" (1/1) ... [2025-03-03 13:27:01,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:27:01,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:01,731 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 13:27:01,735 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 13:27:01,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:27:01,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:27:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 13:27:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 13:27:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 13:27:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-03 13:27:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-03 13:27:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-03 13:27:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-03 13:27:01,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-03 13:27:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-03 13:27:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 13:27:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 13:27:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 13:27:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 13:27:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 13:27:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-03 13:27:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:27:01,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:27:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 13:27:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 13:27:01,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 13:27:01,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 13:27:01,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-03 13:27:01,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 13:27:01,836 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:27:01,837 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:27:02,065 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: call ULTIMATE.dealloc(main_~#Source~0#1.base, main_~#Source~0#1.offset);havoc main_~#Source~0#1.base, main_~#Source~0#1.offset;call ULTIMATE.dealloc(main_~#Dest~0#1.base, main_~#Dest~0#1.offset);havoc main_~#Dest~0#1.base, main_~#Dest~0#1.offset;call ULTIMATE.dealloc(main_~#Weight~0#1.base, main_~#Weight~0#1.offset);havoc main_~#Weight~0#1.base, main_~#Weight~0#1.offset;call ULTIMATE.dealloc(main_~#distance~0#1.base, main_~#distance~0#1.offset);havoc main_~#distance~0#1.base, main_~#distance~0#1.offset; [2025-03-03 13:27:02,075 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 13:27:02,075 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:27:02,082 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:27:02,083 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:27:02,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:27:02 BoogieIcfgContainer [2025-03-03 13:27:02,083 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:27:02,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:27:02,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:27:02,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:27:02,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:27:01" (1/3) ... [2025-03-03 13:27:02,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ccd2d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:27:02, skipping insertion in model container [2025-03-03 13:27:02,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:01" (2/3) ... [2025-03-03 13:27:02,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ccd2d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:27:02, skipping insertion in model container [2025-03-03 13:27:02,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:27:02" (3/3) ... [2025-03-03 13:27:02,091 INFO L128 eAbstractionObserver]: Analyzing ICFG eureka_01-2.c [2025-03-03 13:27:02,103 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:27:02,106 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG eureka_01-2.c that has 1 procedures, 19 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-03 13:27:02,147 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:27:02,157 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;@616c358a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:27:02,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:27:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:02,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:27:02,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:02,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:02,165 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:02,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:02,169 INFO L85 PathProgramCache]: Analyzing trace with hash -2026912553, now seen corresponding path program 1 times [2025-03-03 13:27:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:02,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230714844] [2025-03-03 13:27:02,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:02,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:02,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:27:02,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:27:02,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:02,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:27:02,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:02,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230714844] [2025-03-03 13:27:02,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230714844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:27:02,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:27:02,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 13:27:02,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362367096] [2025-03-03 13:27:02,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:27:02,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 13:27:02,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:02,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 13:27:02,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:27:02,580 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:02,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:02,620 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2025-03-03 13:27:02,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 13:27:02,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 13:27:02,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:02,626 INFO L225 Difference]: With dead ends: 36 [2025-03-03 13:27:02,626 INFO L226 Difference]: Without dead ends: 19 [2025-03-03 13:27:02,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 13:27:02,630 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 32 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 13:27:02,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 32 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:02,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-03 13:27:02,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2025-03-03 13:27:02,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2025-03-03 13:27:02,650 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 8 [2025-03-03 13:27:02,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:02,650 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-03-03 13:27:02,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:02,651 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2025-03-03 13:27:02,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 13:27:02,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:02,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:02,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:27:02,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:02,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:02,652 INFO L85 PathProgramCache]: Analyzing trace with hash -74656557, now seen corresponding path program 1 times [2025-03-03 13:27:02,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:02,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168507614] [2025-03-03 13:27:02,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:02,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:02,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-03 13:27:02,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 13:27:02,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:02,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:27:02,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:02,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168507614] [2025-03-03 13:27:02,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168507614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:27:02,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:27:02,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:27:02,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458676180] [2025-03-03 13:27:02,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:27:02,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:27:02,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:02,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:27:02,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:27:02,851 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:02,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:02,900 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2025-03-03 13:27:02,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:27:02,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-03 13:27:02,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:02,901 INFO L225 Difference]: With dead ends: 37 [2025-03-03 13:27:02,901 INFO L226 Difference]: Without dead ends: 30 [2025-03-03 13:27:02,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 13:27:02,902 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:02,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 18 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:02,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-03 13:27:02,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2025-03-03 13:27:02,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2025-03-03 13:27:02,909 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 11 [2025-03-03 13:27:02,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:02,909 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-03-03 13:27:02,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:02,909 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2025-03-03 13:27:02,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 13:27:02,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:02,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:02,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:27:02,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:02,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:02,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1758905864, now seen corresponding path program 1 times [2025-03-03 13:27:02,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:02,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285278422] [2025-03-03 13:27:02,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:02,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:02,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 13:27:02,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 13:27:02,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:02,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:03,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:27:03,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:03,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285278422] [2025-03-03 13:27:03,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285278422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:27:03,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:27:03,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:27:03,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365628347] [2025-03-03 13:27:03,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:27:03,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:27:03,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:03,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:27:03,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:27:03,088 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:03,119 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2025-03-03 13:27:03,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:27:03,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-03 13:27:03,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:03,121 INFO L225 Difference]: With dead ends: 32 [2025-03-03 13:27:03,121 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 13:27:03,121 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 13:27:03,123 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:03,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 36 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 13:27:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-03 13:27:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2025-03-03 13:27:03,128 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 13 [2025-03-03 13:27:03,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:03,129 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-03-03 13:27:03,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:03,129 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2025-03-03 13:27:03,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 13:27:03,130 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:03,130 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:03,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 13:27:03,130 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:03,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:03,131 INFO L85 PathProgramCache]: Analyzing trace with hash 994622360, now seen corresponding path program 1 times [2025-03-03 13:27:03,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:03,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183419] [2025-03-03 13:27:03,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:03,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:03,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 13:27:03,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 13:27:03,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:03,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:03,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:27:03,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:03,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183419] [2025-03-03 13:27:03,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:27:03,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:27:03,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:27:03,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910384717] [2025-03-03 13:27:03,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:27:03,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:27:03,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:03,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:27:03,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:27:03,251 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:03,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:03,289 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-03-03 13:27:03,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:27:03,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-03 13:27:03,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:03,292 INFO L225 Difference]: With dead ends: 32 [2025-03-03 13:27:03,292 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 13:27:03,292 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 13:27:03,292 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:03,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 21 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:03,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 13:27:03,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2025-03-03 13:27:03,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2025-03-03 13:27:03,297 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 16 [2025-03-03 13:27:03,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:03,298 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2025-03-03 13:27:03,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:03,298 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2025-03-03 13:27:03,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:27:03,298 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:03,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:03,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 13:27:03,299 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:03,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:03,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1768210505, now seen corresponding path program 1 times [2025-03-03 13:27:03,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:03,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641991639] [2025-03-03 13:27:03,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:03,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:03,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:27:03,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:27:03,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:03,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:03,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:27:03,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:03,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641991639] [2025-03-03 13:27:03,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641991639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:03,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340893531] [2025-03-03 13:27:03,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:03,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:03,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:03,477 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 13:27:03,478 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 13:27:03,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:27:03,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:27:03,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:03,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:03,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 13:27:03,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:03,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:27:03,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:27:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340893531] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:03,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:03,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-03 13:27:03,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222331114] [2025-03-03 13:27:03,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:03,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 13:27:03,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:03,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 13:27:03,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:27:03,684 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:03,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:03,751 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2025-03-03 13:27:03,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 13:27:03,752 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-03 13:27:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:03,752 INFO L225 Difference]: With dead ends: 43 [2025-03-03 13:27:03,752 INFO L226 Difference]: Without dead ends: 29 [2025-03-03 13:27:03,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-03-03 13:27:03,753 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:03,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 49 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:27:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-03 13:27:03,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-03 13:27:03,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:03,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2025-03-03 13:27:03,761 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 18 [2025-03-03 13:27:03,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:03,761 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2025-03-03 13:27:03,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2025-03-03 13:27:03,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 13:27:03,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:03,761 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:03,767 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 13:27:03,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:03,963 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:03,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:03,963 INFO L85 PathProgramCache]: Analyzing trace with hash 130868787, now seen corresponding path program 2 times [2025-03-03 13:27:03,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:03,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368345367] [2025-03-03 13:27:03,964 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:27:03,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:04,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-03 13:27:04,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:27:04,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:27:04,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 13:27:04,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:04,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368345367] [2025-03-03 13:27:04,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368345367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:04,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756980730] [2025-03-03 13:27:04,125 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:27:04,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:04,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:04,128 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 13:27:04,129 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 13:27:04,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-03 13:27:04,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:27:04,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:27:04,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:04,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 13:27:04,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 13:27:04,477 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 13:27:04,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756980730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:27:04,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 13:27:04,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-03 13:27:04,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513882874] [2025-03-03 13:27:04,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:27:04,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:27:04,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:04,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:27:04,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:27:04,479 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:04,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:04,519 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2025-03-03 13:27:04,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:27:04,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 13:27:04,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:04,520 INFO L225 Difference]: With dead ends: 61 [2025-03-03 13:27:04,520 INFO L226 Difference]: Without dead ends: 39 [2025-03-03 13:27:04,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 13:27:04,521 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:04,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 25 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:04,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-03 13:27:04,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2025-03-03 13:27:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-03 13:27:04,525 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 27 [2025-03-03 13:27:04,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:04,525 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-03 13:27:04,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:04,525 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-03 13:27:04,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 13:27:04,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:04,526 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:04,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 13:27:04,726 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 13:27:04,726 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:04,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:04,727 INFO L85 PathProgramCache]: Analyzing trace with hash 852699156, now seen corresponding path program 1 times [2025-03-03 13:27:04,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:04,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227519433] [2025-03-03 13:27:04,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:04,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:04,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 13:27:04,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:27:04,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:04,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:27:04,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:04,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227519433] [2025-03-03 13:27:04,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227519433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:04,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326041823] [2025-03-03 13:27:04,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:04,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:04,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:04,890 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 13:27:04,892 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 13:27:05,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 13:27:05,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 13:27:05,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:05,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:05,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 13:27:05,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:05,120 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:27:05,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:27:05,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326041823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:05,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:05,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-03 13:27:05,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272064176] [2025-03-03 13:27:05,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:05,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:27:05,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:05,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:27:05,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:27:05,177 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:05,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:05,233 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2025-03-03 13:27:05,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 13:27:05,234 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-03 13:27:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:05,234 INFO L225 Difference]: With dead ends: 48 [2025-03-03 13:27:05,234 INFO L226 Difference]: Without dead ends: 34 [2025-03-03 13:27:05,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:27:05,237 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:05,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 67 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:05,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-03 13:27:05,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-03-03 13:27:05,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-03-03 13:27:05,241 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 27 [2025-03-03 13:27:05,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:05,241 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-03 13:27:05,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-03-03 13:27:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 13:27:05,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:05,241 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:05,247 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 13:27:05,442 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 13:27:05,442 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:05,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:05,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1707717257, now seen corresponding path program 2 times [2025-03-03 13:27:05,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:05,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978694190] [2025-03-03 13:27:05,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:27:05,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:05,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-03 13:27:05,488 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:27:05,488 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:27:05,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:05,565 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 13:27:05,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:05,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978694190] [2025-03-03 13:27:05,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978694190] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:05,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472764007] [2025-03-03 13:27:05,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:27:05,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:05,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:05,568 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 13:27:05,570 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 13:27:05,676 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-03 13:27:05,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 13:27:05,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:27:05,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:05,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 13:27:05,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 13:27:05,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 13:27:05,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472764007] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:05,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:05,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-03 13:27:05,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012168934] [2025-03-03 13:27:05,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:05,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 13:27:05,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:05,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 13:27:05,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-03 13:27:05,961 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:06,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:06,046 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2025-03-03 13:27:06,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:27:06,047 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-03 13:27:06,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:06,048 INFO L225 Difference]: With dead ends: 78 [2025-03-03 13:27:06,048 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 13:27:06,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:27:06,049 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 118 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:06,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 37 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:27:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 13:27:06,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 47. [2025-03-03 13:27:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2025-03-03 13:27:06,055 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 30 [2025-03-03 13:27:06,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:06,055 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-03-03 13:27:06,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:06,055 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2025-03-03 13:27:06,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 13:27:06,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:06,056 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:06,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 13:27:06,256 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 13:27:06,256 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:06,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash -356606286, now seen corresponding path program 3 times [2025-03-03 13:27:06,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:06,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907996103] [2025-03-03 13:27:06,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:27:06,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:06,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 8 equivalence classes. [2025-03-03 13:27:06,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 45 statements. [2025-03-03 13:27:06,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 13:27:06,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 13:27:06,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:06,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907996103] [2025-03-03 13:27:06,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907996103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:06,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732605183] [2025-03-03 13:27:06,351 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:27:06,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:06,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:06,353 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 13:27:06,354 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 13:27:06,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 8 equivalence classes. [2025-03-03 13:27:06,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 45 statements. [2025-03-03 13:27:06,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 13:27:06,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:06,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 13:27:06,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 13:27:06,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:06,711 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 13:27:06,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732605183] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:06,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:06,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-03 13:27:06,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690415147] [2025-03-03 13:27:06,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:06,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 13:27:06,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:06,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 13:27:06,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-03 13:27:06,712 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:06,785 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2025-03-03 13:27:06,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 13:27:06,785 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-03 13:27:06,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:06,786 INFO L225 Difference]: With dead ends: 62 [2025-03-03 13:27:06,786 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 13:27:06,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 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 13:27:06,787 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 77 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:06,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 41 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:27:06,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 13:27:06,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2025-03-03 13:27:06,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2025-03-03 13:27:06,792 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 45 [2025-03-03 13:27:06,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:06,792 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2025-03-03 13:27:06,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:06,793 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2025-03-03 13:27:06,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 13:27:06,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:06,793 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:06,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 13:27:06,994 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 13:27:06,994 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:06,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:06,994 INFO L85 PathProgramCache]: Analyzing trace with hash 421805135, now seen corresponding path program 4 times [2025-03-03 13:27:06,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:06,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550603797] [2025-03-03 13:27:06,994 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:27:06,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:07,026 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-03-03 13:27:07,037 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 49 of 51 statements. [2025-03-03 13:27:07,038 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 13:27:07,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:07,146 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-03 13:27:07,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:07,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550603797] [2025-03-03 13:27:07,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550603797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:07,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362472306] [2025-03-03 13:27:07,147 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 13:27:07,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:07,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:07,149 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 13:27:07,151 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 13:27:07,268 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-03-03 13:27:07,290 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 49 of 51 statements. [2025-03-03 13:27:07,290 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 13:27:07,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:07,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 13:27:07,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:07,353 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 13:27:07,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 13:27:07,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362472306] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:07,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:07,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2025-03-03 13:27:07,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147526434] [2025-03-03 13:27:07,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:07,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:27:07,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:07,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:27:07,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:27:07,404 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:07,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:07,526 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2025-03-03 13:27:07,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:27:07,527 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-03 13:27:07,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:07,528 INFO L225 Difference]: With dead ends: 109 [2025-03-03 13:27:07,528 INFO L226 Difference]: Without dead ends: 73 [2025-03-03 13:27:07,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2025-03-03 13:27:07,528 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:07,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 100 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:27:07,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-03 13:27:07,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2025-03-03 13:27:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2025-03-03 13:27:07,539 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 51 [2025-03-03 13:27:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:07,539 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2025-03-03 13:27:07,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:07,540 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2025-03-03 13:27:07,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-03 13:27:07,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:07,542 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:07,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 13:27:07,742 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 13:27:07,742 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:07,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:07,743 INFO L85 PathProgramCache]: Analyzing trace with hash -322432861, now seen corresponding path program 5 times [2025-03-03 13:27:07,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:07,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671102812] [2025-03-03 13:27:07,743 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:27:07,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:07,775 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 63 statements into 12 equivalence classes. [2025-03-03 13:27:07,946 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 13:27:07,947 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-03 13:27:07,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 74 proven. 22 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-03 13:27:08,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:08,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671102812] [2025-03-03 13:27:08,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671102812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:08,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806813623] [2025-03-03 13:27:08,087 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 13:27:08,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:08,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:08,089 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 13:27:08,091 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 13:27:08,194 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 63 statements into 12 equivalence classes. [2025-03-03 13:27:08,482 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 63 of 63 statements. [2025-03-03 13:27:08,482 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-03 13:27:08,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:08,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 13:27:08,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:08,559 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 95 proven. 5 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-03-03 13:27:08,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:08,635 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 81 proven. 19 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2025-03-03 13:27:08,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806813623] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:08,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:08,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2025-03-03 13:27:08,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642582599] [2025-03-03 13:27:08,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:08,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 13:27:08,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:08,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 13:27:08,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2025-03-03 13:27:08,637 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:08,703 INFO L93 Difference]: Finished difference Result 152 states and 211 transitions. [2025-03-03 13:27:08,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 13:27:08,703 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-03 13:27:08,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:08,704 INFO L225 Difference]: With dead ends: 152 [2025-03-03 13:27:08,704 INFO L226 Difference]: Without dead ends: 113 [2025-03-03 13:27:08,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=205, Unknown=0, NotChecked=0, Total=342 [2025-03-03 13:27:08,705 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:08,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 94 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-03 13:27:08,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-03 13:27:08,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 112 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 145 transitions. [2025-03-03 13:27:08,714 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 145 transitions. Word has length 63 [2025-03-03 13:27:08,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:08,715 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 145 transitions. [2025-03-03 13:27:08,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.8823529411764706) internal successors, (66), 17 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:08,715 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 145 transitions. [2025-03-03 13:27:08,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 13:27:08,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:08,716 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:08,723 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 13:27:08,916 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 13:27:08,916 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:08,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:08,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1612780451, now seen corresponding path program 6 times [2025-03-03 13:27:08,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:08,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14420113] [2025-03-03 13:27:08,917 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:27:08,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:08,973 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 111 statements into 28 equivalence classes. [2025-03-03 13:27:09,426 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 43 of 111 statements. [2025-03-03 13:27:09,427 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-03 13:27:09,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 991 backedges. 481 proven. 117 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2025-03-03 13:27:44,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:44,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14420113] [2025-03-03 13:27:44,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14420113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:44,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74514575] [2025-03-03 13:27:44,562 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 13:27:44,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:44,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:44,564 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 13:27:44,565 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 13:27:44,693 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 111 statements into 28 equivalence classes. [2025-03-03 13:27:46,137 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 43 of 111 statements. [2025-03-03 13:27:46,138 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-03 13:27:46,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:46,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 183 conjuncts are in the unsatisfiable core [2025-03-03 13:27:46,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:46,203 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 67 treesize of output 66 [2025-03-03 13:27:46,218 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 67 treesize of output 66 [2025-03-03 13:27:46,248 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 67 treesize of output 66 [2025-03-03 13:27:53,509 INFO L349 Elim1Store]: treesize reduction 60, result has 34.8 percent of original size [2025-03-03 13:27:53,509 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 2 case distinctions, treesize of input 76 treesize of output 67 [2025-03-03 13:27:56,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:27:56,485 INFO L349 Elim1Store]: treesize reduction 192, result has 43.2 percent of original size [2025-03-03 13:27:56,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 117 treesize of output 194 [2025-03-03 13:28:00,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:28:03,121 INFO L349 Elim1Store]: treesize reduction 460, result has 34.7 percent of original size [2025-03-03 13:28:03,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 343 treesize of output 434 [2025-03-03 13:28:08,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 13:28:11,157 INFO L349 Elim1Store]: treesize reduction 254, result has 59.1 percent of original size [2025-03-03 13:28:11,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 494 treesize of output 640 [2025-03-03 13:28:11,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 523 treesize of output 477