/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:24:51,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:24:51,110 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 17:24:51,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:24:51,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:24:51,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:24:51,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:24:51,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:24:51,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:24:51,136 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:24:51,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:24:51,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:24:51,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:24:51,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:24:51,137 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:24:51,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:24:51,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:24:51,137 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:24:51,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:24:51,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:24:51,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:24:51,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:24:51,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:24:51,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:24:51,137 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:24:51,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:24:51,137 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:24:51,137 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:24:51,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:24:51,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:24:51,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:24:51,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:24:51,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:24:51,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:24:51,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:24:51,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:24:51,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:24:51,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:24:51,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:24:51,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:24:51,138 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:24:51,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:24:51,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:24:51,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:24:51,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:24:51,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:24:51,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:24:51,140 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 17:24:51,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:24:51,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:24:51,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:24:51,386 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:24:51,386 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:24:51,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2025-04-13 17:24:52,689 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/360161bb4/6fe4940fc6e34126b479ab40c91afc6c/FLAG01a416688 [2025-04-13 17:24:53,001 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:24:53,001 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i [2025-04-13 17:24:53,023 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/360161bb4/6fe4940fc6e34126b479ab40c91afc6c/FLAG01a416688 [2025-04-13 17:24:53,689 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/360161bb4/6fe4940fc6e34126b479ab40c91afc6c [2025-04-13 17:24:53,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:24:53,692 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:24:53,693 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:24:53,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:24:53,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:24:53,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:24:53" (1/1) ... [2025-04-13 17:24:53,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eed6585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:53, skipping insertion in model container [2025-04-13 17:24:53,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:24:53" (1/1) ... [2025-04-13 17:24:53,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:24:54,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[76469,76482] [2025-04-13 17:24:54,302 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79042,79055] [2025-04-13 17:24:54,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79451,79464] [2025-04-13 17:24:54,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:24:54,342 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:24:54,413 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[76469,76482] [2025-04-13 17:24:54,442 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79042,79055] [2025-04-13 17:24:54,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/workstealqueue_mutex-2.i[79451,79464] [2025-04-13 17:24:54,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:24:54,538 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:24:54,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:54 WrapperNode [2025-04-13 17:24:54,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:24:54,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:24:54,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:24:54,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:24:54,545 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:54" (1/1) ... [2025-04-13 17:24:54,578 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:54" (1/1) ... [2025-04-13 17:24:54,691 INFO L138 Inliner]: procedures = 491, calls = 156, calls flagged for inlining = 45, calls inlined = 117, statements flattened = 1847 [2025-04-13 17:24:54,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:24:54,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:24:54,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:24:54,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:24:54,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:54" (1/1) ... [2025-04-13 17:24:54,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:54" (1/1) ... [2025-04-13 17:24:54,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:54" (1/1) ... [2025-04-13 17:24:54,764 INFO L175 MemorySlicer]: Split 311 memory accesses to 9 slices as follows [2, 2, 4, 2, 8, 195, 12, 6, 80]. 63 percent of accesses are in the largest equivalence class. The 54 initializations are split as follows [2, 0, 0, 0, 2, 26, 4, 0, 20]. The 95 writes are split as follows [0, 1, 2, 1, 2, 61, 4, 4, 20]. [2025-04-13 17:24:54,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:54" (1/1) ... [2025-04-13 17:24:54,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:54" (1/1) ... [2025-04-13 17:24:54,807 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:54" (1/1) ... [2025-04-13 17:24:54,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:54" (1/1) ... [2025-04-13 17:24:54,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:54" (1/1) ... [2025-04-13 17:24:54,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:54" (1/1) ... [2025-04-13 17:24:54,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:54" (1/1) ... [2025-04-13 17:24:54,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:24:54,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:24:54,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:24:54,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:24:54,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:54" (1/1) ... [2025-04-13 17:24:54,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:24:54,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:24:54,883 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-04-13 17:24:54,886 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-04-13 17:24:54,901 INFO L130 BoogieDeclarations]: Found specification of procedure Stealer [2025-04-13 17:24:54,902 INFO L138 BoogieDeclarations]: Found implementation of procedure Stealer [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-04-13 17:24:54,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:24:54,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-04-13 17:24:54,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-04-13 17:24:54,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-04-13 17:24:54,907 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 17:24:55,148 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:24:55,149 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:24:56,675 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:24:56,676 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:24:56,676 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:24:57,966 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:24:58,017 WARN L179 LargeBlockEncoding]: Complex 2:4 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:24:58,024 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:24:58,026 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:24:58,029 WARN L179 LargeBlockEncoding]: Complex 4:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:24:58,038 WARN L179 LargeBlockEncoding]: Complex 2:4 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:24:58,047 WARN L179 LargeBlockEncoding]: Complex 6:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:24:58,062 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:24:58,066 WARN L179 LargeBlockEncoding]: Complex 7:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:24:58,076 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:24:58,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:24:58 BoogieIcfgContainer [2025-04-13 17:24:58,077 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:24:58,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:24:58,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:24:58,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:24:58,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:24:53" (1/3) ... [2025-04-13 17:24:58,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3de7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:24:58, skipping insertion in model container [2025-04-13 17:24:58,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:54" (2/3) ... [2025-04-13 17:24:58,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3de7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:24:58, skipping insertion in model container [2025-04-13 17:24:58,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:24:58" (3/3) ... [2025-04-13 17:24:58,085 INFO L128 eAbstractionObserver]: Analyzing ICFG workstealqueue_mutex-2.i [2025-04-13 17:24:58,098 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:24:58,099 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG workstealqueue_mutex-2.i that has 2 procedures, 163 locations, 233 edges, 1 initial locations, 11 loop locations, and 5 error locations. [2025-04-13 17:24:58,099 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:24:58,226 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-13 17:24:58,293 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 166 places, 234 transitions, 475 flow [2025-04-13 17:24:58,406 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2401 states, 2388 states have (on average 2.6009212730318256) internal successors, (6211), 2400 states have internal predecessors, (6211), 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-04-13 17:24:58,426 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:24:58,436 INFO L340 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=FINITE_AUTOMATA, 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;@c7506ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:24:58,436 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 17:24:58,445 INFO L278 IsEmpty]: Start isEmpty. Operand has 2401 states, 2388 states have (on average 2.6009212730318256) internal successors, (6211), 2400 states have internal predecessors, (6211), 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-04-13 17:24:58,449 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 17:24:58,449 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:24:58,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:24:58,450 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:24:58,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:24:58,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1324009626, now seen corresponding path program 1 times [2025-04-13 17:24:58,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:24:58,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188378343] [2025-04-13 17:24:58,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:24:58,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:24:58,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 17:24:58,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 17:24:58,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:24:58,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:24:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:24:58,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:24:58,760 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188378343] [2025-04-13 17:24:58,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188378343] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:24:58,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:24:58,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:24:58,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110866959] [2025-04-13 17:24:58,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:24:58,767 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 17:24:58,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:24:58,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 17:24:58,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:24:58,794 INFO L87 Difference]: Start difference. First operand has 2401 states, 2388 states have (on average 2.6009212730318256) internal successors, (6211), 2400 states have internal predecessors, (6211), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-04-13 17:24:59,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:24:59,235 INFO L93 Difference]: Finished difference Result 3038 states and 7687 transitions. [2025-04-13 17:24:59,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 17:24:59,237 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-04-13 17:24:59,237 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:24:59,272 INFO L225 Difference]: With dead ends: 3038 [2025-04-13 17:24:59,272 INFO L226 Difference]: Without dead ends: 2218 [2025-04-13 17:24:59,278 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:24:59,284 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:24:59,284 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:24:59,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2025-04-13 17:24:59,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2025-04-13 17:24:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 2212 states have (on average 2.5289330922242317) internal successors, (5594), 2217 states have internal predecessors, (5594), 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-04-13 17:24:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 5594 transitions. [2025-04-13 17:24:59,415 INFO L79 Accepts]: Start accepts. Automaton has 2218 states and 5594 transitions. Word has length 7 [2025-04-13 17:24:59,416 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:24:59,416 INFO L485 AbstractCegarLoop]: Abstraction has 2218 states and 5594 transitions. [2025-04-13 17:24:59,416 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-04-13 17:24:59,416 INFO L278 IsEmpty]: Start isEmpty. Operand 2218 states and 5594 transitions. [2025-04-13 17:24:59,416 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 17:24:59,416 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:24:59,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:24:59,417 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:24:59,417 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:24:59,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:24:59,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1063073301, now seen corresponding path program 1 times [2025-04-13 17:24:59,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:24:59,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228046105] [2025-04-13 17:24:59,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:24:59,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:24:59,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 17:24:59,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 17:24:59,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:24:59,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:24:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:24:59,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:24:59,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228046105] [2025-04-13 17:24:59,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228046105] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:24:59,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:24:59,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:24:59,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216110172] [2025-04-13 17:24:59,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:24:59,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:24:59,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:24:59,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:24:59,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:24:59,595 INFO L87 Difference]: Start difference. First operand 2218 states and 5594 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-04-13 17:24:59,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:24:59,699 INFO L93 Difference]: Finished difference Result 2268 states and 5702 transitions. [2025-04-13 17:24:59,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:24:59,700 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2025-04-13 17:24:59,700 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:24:59,704 INFO L225 Difference]: With dead ends: 2268 [2025-04-13 17:24:59,704 INFO L226 Difference]: Without dead ends: 56 [2025-04-13 17:24:59,706 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:24:59,707 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 20 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:24:59,707 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:24:59,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-04-13 17:24:59,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-04-13 17:24:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.7818181818181817) internal successors, (98), 55 states have internal predecessors, (98), 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-04-13 17:24:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 98 transitions. [2025-04-13 17:24:59,711 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 98 transitions. Word has length 9 [2025-04-13 17:24:59,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:24:59,711 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 98 transitions. [2025-04-13 17:24:59,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-04-13 17:24:59,711 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 98 transitions. [2025-04-13 17:24:59,711 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-13 17:24:59,711 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:24:59,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:24:59,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:24:59,712 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:24:59,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:24:59,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1411328745, now seen corresponding path program 1 times [2025-04-13 17:24:59,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:24:59,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109857017] [2025-04-13 17:24:59,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:24:59,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:24:59,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 17:24:59,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 17:24:59,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:24:59,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:24:59,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:24:59,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:24:59,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109857017] [2025-04-13 17:24:59,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109857017] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:24:59,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108134918] [2025-04-13 17:24:59,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:24:59,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:24:59,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:24:59,908 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-04-13 17:24:59,909 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-04-13 17:25:00,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 17:25:00,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 17:25:00,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:00,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:00,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 17:25:00,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:25:00,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:00,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:25:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:00,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108134918] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:25:00,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:25:00,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 17:25:00,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389406814] [2025-04-13 17:25:00,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:25:00,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:25:00,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:00,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:25:00,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:25:00,134 INFO L87 Difference]: Start difference. First operand 56 states and 98 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-04-13 17:25:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:00,251 INFO L93 Difference]: Finished difference Result 108 states and 194 transitions. [2025-04-13 17:25:00,251 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:25:00,252 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 10 [2025-04-13 17:25:00,252 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:00,253 INFO L225 Difference]: With dead ends: 108 [2025-04-13 17:25:00,253 INFO L226 Difference]: Without dead ends: 59 [2025-04-13 17:25:00,254 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:25:00,254 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 40 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:00,254 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:25:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-13 17:25:00,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-04-13 17:25:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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-04-13 17:25:00,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 101 transitions. [2025-04-13 17:25:00,260 INFO L79 Accepts]: Start accepts. Automaton has 59 states and 101 transitions. Word has length 10 [2025-04-13 17:25:00,260 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:00,260 INFO L485 AbstractCegarLoop]: Abstraction has 59 states and 101 transitions. [2025-04-13 17:25:00,260 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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-04-13 17:25:00,260 INFO L278 IsEmpty]: Start isEmpty. Operand 59 states and 101 transitions. [2025-04-13 17:25:00,261 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-13 17:25:00,261 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:00,261 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:00,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 17:25:00,461 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:25:00,461 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:25:00,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:00,463 INFO L85 PathProgramCache]: Analyzing trace with hash 315483797, now seen corresponding path program 2 times [2025-04-13 17:25:00,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:00,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664855977] [2025-04-13 17:25:00,464 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:25:00,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:00,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-13 17:25:00,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 17:25:00,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:25:00,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:25:00,558 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 17:25:00,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-13 17:25:00,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-13 17:25:00,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:00,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 17:25:00,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 17:25:00,625 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 17:25:00,626 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-13 17:25:00,628 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 17:25:00,629 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 17:25:00,629 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 17:25:00,629 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 17:25:00,629 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 17:25:00,629 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:25:00,631 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2025-04-13 17:25:00,632 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-13 17:25:00,633 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-13 17:25:00,753 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 17:25:00,758 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 184 places, 256 transitions, 528 flow [2025-04-13 17:25:01,738 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 38577 states, 38556 states have (on average 3.829235397862849) internal successors, (147640), 38576 states have internal predecessors, (147640), 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-04-13 17:25:01,739 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:25:01,740 INFO L340 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=FINITE_AUTOMATA, 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;@c7506ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:25:01,740 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 17:25:01,826 INFO L278 IsEmpty]: Start isEmpty. Operand has 38577 states, 38556 states have (on average 3.829235397862849) internal successors, (147640), 38576 states have internal predecessors, (147640), 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-04-13 17:25:01,827 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-13 17:25:01,827 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:01,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:01,828 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:25:01,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:01,828 INFO L85 PathProgramCache]: Analyzing trace with hash -124884582, now seen corresponding path program 1 times [2025-04-13 17:25:01,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:01,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771735596] [2025-04-13 17:25:01,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:25:01,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:01,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 17:25:01,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 17:25:01,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:01,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:01,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:01,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:01,876 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771735596] [2025-04-13 17:25:01,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771735596] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:01,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:01,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:25:01,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986805253] [2025-04-13 17:25:01,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:01,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 17:25:01,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:01,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 17:25:01,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:25:01,956 INFO L87 Difference]: Start difference. First operand has 38577 states, 38556 states have (on average 3.829235397862849) internal successors, (147640), 38576 states have internal predecessors, (147640), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-04-13 17:25:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:02,930 INFO L93 Difference]: Finished difference Result 51060 states and 190110 transitions. [2025-04-13 17:25:02,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 17:25:02,930 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2025-04-13 17:25:02,931 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:03,178 INFO L225 Difference]: With dead ends: 51060 [2025-04-13 17:25:03,178 INFO L226 Difference]: Without dead ends: 37642 [2025-04-13 17:25:03,226 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 17:25:03,227 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:03,227 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:25:03,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37642 states. [2025-04-13 17:25:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37642 to 37642. [2025-04-13 17:25:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37642 states, 37630 states have (on average 3.6442466117459476) internal successors, (137133), 37641 states have internal predecessors, (137133), 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-04-13 17:25:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37642 states to 37642 states and 137133 transitions. [2025-04-13 17:25:04,537 INFO L79 Accepts]: Start accepts. Automaton has 37642 states and 137133 transitions. Word has length 7 [2025-04-13 17:25:04,538 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:04,538 INFO L485 AbstractCegarLoop]: Abstraction has 37642 states and 137133 transitions. [2025-04-13 17:25:04,538 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-04-13 17:25:04,538 INFO L278 IsEmpty]: Start isEmpty. Operand 37642 states and 137133 transitions. [2025-04-13 17:25:04,538 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 17:25:04,538 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:04,538 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:04,539 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:25:04,539 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:25:04,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:04,539 INFO L85 PathProgramCache]: Analyzing trace with hash -613940767, now seen corresponding path program 1 times [2025-04-13 17:25:04,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:04,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225629429] [2025-04-13 17:25:04,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:25:04,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:04,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 17:25:04,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 17:25:04,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:04,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:04,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:04,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225629429] [2025-04-13 17:25:04,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225629429] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:04,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:04,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:25:04,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842535639] [2025-04-13 17:25:04,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:04,625 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:25:04,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:04,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:25:04,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:25:04,625 INFO L87 Difference]: Start difference. First operand 37642 states and 137133 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-04-13 17:25:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:06,510 INFO L93 Difference]: Finished difference Result 107377 states and 396729 transitions. [2025-04-13 17:25:06,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:25:06,511 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-04-13 17:25:06,511 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:06,971 INFO L225 Difference]: With dead ends: 107377 [2025-04-13 17:25:06,971 INFO L226 Difference]: Without dead ends: 69741 [2025-04-13 17:25:07,066 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:25:07,069 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 216 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:07,069 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 2 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:25:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69741 states. [2025-04-13 17:25:08,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69741 to 68715. [2025-04-13 17:25:08,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68715 states, 68709 states have (on average 3.7272555269324252) internal successors, (256096), 68714 states have internal predecessors, (256096), 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-04-13 17:25:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68715 states to 68715 states and 256096 transitions. [2025-04-13 17:25:09,477 INFO L79 Accepts]: Start accepts. Automaton has 68715 states and 256096 transitions. Word has length 11 [2025-04-13 17:25:09,477 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:09,477 INFO L485 AbstractCegarLoop]: Abstraction has 68715 states and 256096 transitions. [2025-04-13 17:25:09,477 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-04-13 17:25:09,477 INFO L278 IsEmpty]: Start isEmpty. Operand 68715 states and 256096 transitions. [2025-04-13 17:25:09,477 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 17:25:09,477 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:09,478 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:09,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 17:25:09,478 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:25:09,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:09,478 INFO L85 PathProgramCache]: Analyzing trace with hash -416987293, now seen corresponding path program 1 times [2025-04-13 17:25:09,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:09,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680479356] [2025-04-13 17:25:09,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:25:09,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:09,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:25:09,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:25:09,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:09,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:09,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:09,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:09,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680479356] [2025-04-13 17:25:09,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680479356] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:25:09,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903291331] [2025-04-13 17:25:09,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:25:09,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:25:09,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:25:09,580 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-04-13 17:25:09,581 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-04-13 17:25:09,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 17:25:09,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 17:25:09,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:09,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:09,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 17:25:09,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:25:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:09,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:25:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:25:09,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903291331] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:25:09,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:25:09,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 17:25:09,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692734270] [2025-04-13 17:25:09,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:25:09,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:25:09,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:09,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:25:09,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:25:09,784 INFO L87 Difference]: Start difference. First operand 68715 states and 256096 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-04-13 17:25:11,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:11,834 INFO L93 Difference]: Finished difference Result 138457 states and 514630 transitions. [2025-04-13 17:25:11,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:25:11,835 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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 12 [2025-04-13 17:25:11,835 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:12,363 INFO L225 Difference]: With dead ends: 138457 [2025-04-13 17:25:12,364 INFO L226 Difference]: Without dead ends: 69749 [2025-04-13 17:25:12,442 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:25:12,442 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 632 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:12,443 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 3 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:25:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69749 states. [2025-04-13 17:25:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69749 to 68718. [2025-04-13 17:25:13,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68718 states, 68712 states have (on average 3.727136453603446) internal successors, (256099), 68717 states have internal predecessors, (256099), 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-04-13 17:25:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68718 states to 68718 states and 256099 transitions. [2025-04-13 17:25:14,650 INFO L79 Accepts]: Start accepts. Automaton has 68718 states and 256099 transitions. Word has length 12 [2025-04-13 17:25:14,651 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:14,651 INFO L485 AbstractCegarLoop]: Abstraction has 68718 states and 256099 transitions. [2025-04-13 17:25:14,651 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-04-13 17:25:14,651 INFO L278 IsEmpty]: Start isEmpty. Operand 68718 states and 256099 transitions. [2025-04-13 17:25:14,652 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 17:25:14,652 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:14,652 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:14,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 17:25:14,852 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-13 17:25:14,852 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:25:14,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:14,853 INFO L85 PathProgramCache]: Analyzing trace with hash -2092019103, now seen corresponding path program 2 times [2025-04-13 17:25:14,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:14,853 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318545015] [2025-04-13 17:25:14,853 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:25:14,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:14,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 17:25:14,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 15 statements. [2025-04-13 17:25:14,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:25:14,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:25:14,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:14,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318545015] [2025-04-13 17:25:14,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318545015] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:14,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:14,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:25:14,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669172188] [2025-04-13 17:25:14,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:14,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:25:14,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:14,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:25:14,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:25:14,948 INFO L87 Difference]: Start difference. First operand 68718 states and 256099 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-04-13 17:25:16,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:16,618 INFO L93 Difference]: Finished difference Result 112051 states and 415062 transitions. [2025-04-13 17:25:16,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 17:25:16,619 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 15 [2025-04-13 17:25:16,619 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:17,185 INFO L225 Difference]: With dead ends: 112051 [2025-04-13 17:25:17,185 INFO L226 Difference]: Without dead ends: 69232 [2025-04-13 17:25:17,252 INFO L436 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-04-13 17:25:17,253 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 449 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:17,253 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 0 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:25:17,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69232 states. [2025-04-13 17:25:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69232 to 68206. [2025-04-13 17:25:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68206 states, 68201 states have (on average 3.7147109279922583) internal successors, (253347), 68205 states have internal predecessors, (253347), 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-04-13 17:25:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68206 states to 68206 states and 253347 transitions. [2025-04-13 17:25:19,361 INFO L79 Accepts]: Start accepts. Automaton has 68206 states and 253347 transitions. Word has length 15 [2025-04-13 17:25:19,362 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:19,362 INFO L485 AbstractCegarLoop]: Abstraction has 68206 states and 253347 transitions. [2025-04-13 17:25:19,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-04-13 17:25:19,362 INFO L278 IsEmpty]: Start isEmpty. Operand 68206 states and 253347 transitions. [2025-04-13 17:25:19,368 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:25:19,368 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:19,369 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:19,369 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 17:25:19,369 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:25:19,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:19,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1674132126, now seen corresponding path program 1 times [2025-04-13 17:25:19,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:19,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436840156] [2025-04-13 17:25:19,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:25:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:19,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:25:19,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:25:19,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:19,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:23,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:25:23,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:23,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436840156] [2025-04-13 17:25:23,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436840156] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:23,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:23,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:25:23,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495018377] [2025-04-13 17:25:23,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:23,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:25:23,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:23,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:25:23,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:25:23,261 INFO L87 Difference]: Start difference. First operand 68206 states and 253347 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 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-04-13 17:25:27,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:27,044 INFO L93 Difference]: Finished difference Result 134585 states and 499351 transitions. [2025-04-13 17:25:27,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:25:27,045 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 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) Word has length 29 [2025-04-13 17:25:27,045 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:27,498 INFO L225 Difference]: With dead ends: 134585 [2025-04-13 17:25:27,498 INFO L226 Difference]: Without dead ends: 69494 [2025-04-13 17:25:27,623 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:25:27,624 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 107 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3287 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:27,624 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 0 Invalid, 3320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3287 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-04-13 17:25:27,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69494 states. [2025-04-13 17:25:29,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69494 to 68444. [2025-04-13 17:25:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68444 states, 68439 states have (on average 3.712386212539634) internal successors, (254072), 68443 states have internal predecessors, (254072), 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-04-13 17:25:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68444 states to 68444 states and 254072 transitions. [2025-04-13 17:25:29,641 INFO L79 Accepts]: Start accepts. Automaton has 68444 states and 254072 transitions. Word has length 29 [2025-04-13 17:25:29,642 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:29,642 INFO L485 AbstractCegarLoop]: Abstraction has 68444 states and 254072 transitions. [2025-04-13 17:25:29,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 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-04-13 17:25:29,642 INFO L278 IsEmpty]: Start isEmpty. Operand 68444 states and 254072 transitions. [2025-04-13 17:25:29,651 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 17:25:29,651 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:29,651 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:29,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 17:25:29,651 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:25:29,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:29,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1396803808, now seen corresponding path program 1 times [2025-04-13 17:25:29,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:29,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987449824] [2025-04-13 17:25:29,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:25:29,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:29,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 17:25:29,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 17:25:29,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:29,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:25:29,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:29,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987449824] [2025-04-13 17:25:29,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987449824] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:29,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:29,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 17:25:29,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743426354] [2025-04-13 17:25:29,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:29,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:25:29,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:29,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:25:29,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:25:29,838 INFO L87 Difference]: Start difference. First operand 68444 states and 254072 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-04-13 17:25:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:30,905 INFO L93 Difference]: Finished difference Result 80841 states and 296790 transitions. [2025-04-13 17:25:30,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:25:30,905 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 33 [2025-04-13 17:25:30,905 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:31,175 INFO L225 Difference]: With dead ends: 80841 [2025-04-13 17:25:31,176 INFO L226 Difference]: Without dead ends: 13100 [2025-04-13 17:25:31,279 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:25:31,281 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 205 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:31,281 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 0 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:25:31,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13100 states. [2025-04-13 17:25:31,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13100 to 13092. [2025-04-13 17:25:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13092 states, 13075 states have (on average 3.10546845124283) internal successors, (40604), 13091 states have internal predecessors, (40604), 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-04-13 17:25:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13092 states to 13092 states and 40604 transitions. [2025-04-13 17:25:31,830 INFO L79 Accepts]: Start accepts. Automaton has 13092 states and 40604 transitions. Word has length 33 [2025-04-13 17:25:31,830 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:31,830 INFO L485 AbstractCegarLoop]: Abstraction has 13092 states and 40604 transitions. [2025-04-13 17:25:31,830 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-04-13 17:25:31,830 INFO L278 IsEmpty]: Start isEmpty. Operand 13092 states and 40604 transitions. [2025-04-13 17:25:31,834 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 17:25:31,834 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:31,834 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:31,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 17:25:31,834 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:25:31,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:31,834 INFO L85 PathProgramCache]: Analyzing trace with hash 289022775, now seen corresponding path program 1 times [2025-04-13 17:25:31,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:31,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731841685] [2025-04-13 17:25:31,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:25:31,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:31,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 17:25:31,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 17:25:31,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:31,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:25:37,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:37,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731841685] [2025-04-13 17:25:37,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731841685] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:37,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:37,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-04-13 17:25:37,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020922764] [2025-04-13 17:25:37,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:37,503 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 17:25:37,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:37,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 17:25:37,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:25:37,504 INFO L87 Difference]: Start difference. First operand 13092 states and 40604 transitions. Second operand has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 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-04-13 17:25:41,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:41,651 INFO L93 Difference]: Finished difference Result 25415 states and 78783 transitions. [2025-04-13 17:25:41,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:25:41,651 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 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 36 [2025-04-13 17:25:41,651 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:41,844 INFO L225 Difference]: With dead ends: 25415 [2025-04-13 17:25:41,844 INFO L226 Difference]: Without dead ends: 13636 [2025-04-13 17:25:41,865 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=968, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 17:25:41,865 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 363 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3765 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 3765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:41,865 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 0 Invalid, 3881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 3765 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 17:25:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13636 states. [2025-04-13 17:25:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13636 to 13164. [2025-04-13 17:25:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13147 states have (on average 3.103369590020537) internal successors, (40800), 13163 states have internal predecessors, (40800), 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-04-13 17:25:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 40800 transitions. [2025-04-13 17:25:42,252 INFO L79 Accepts]: Start accepts. Automaton has 13164 states and 40800 transitions. Word has length 36 [2025-04-13 17:25:42,252 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:42,253 INFO L485 AbstractCegarLoop]: Abstraction has 13164 states and 40800 transitions. [2025-04-13 17:25:42,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 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-04-13 17:25:42,253 INFO L278 IsEmpty]: Start isEmpty. Operand 13164 states and 40800 transitions. [2025-04-13 17:25:42,257 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:25:42,257 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:42,257 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:42,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 17:25:42,257 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:25:42,258 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:42,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1993366545, now seen corresponding path program 1 times [2025-04-13 17:25:42,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:42,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992846928] [2025-04-13 17:25:42,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:25:42,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:42,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 17:25:42,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:25:42,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:25:42,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:43,678 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:25:43,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:43,678 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992846928] [2025-04-13 17:25:43,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992846928] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:43,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:43,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:25:43,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041508800] [2025-04-13 17:25:43,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:43,679 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:25:43,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:43,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:25:43,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:25:43,679 INFO L87 Difference]: Start difference. First operand 13164 states and 40800 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 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-04-13 17:25:46,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:46,348 INFO L93 Difference]: Finished difference Result 25266 states and 78504 transitions. [2025-04-13 17:25:46,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 17:25:46,348 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 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 40 [2025-04-13 17:25:46,348 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:46,628 INFO L225 Difference]: With dead ends: 25266 [2025-04-13 17:25:46,628 INFO L226 Difference]: Without dead ends: 14419 [2025-04-13 17:25:46,648 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:25:46,649 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 208 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3452 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:46,649 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 0 Invalid, 3482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3452 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-04-13 17:25:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14419 states. [2025-04-13 17:25:46,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14419 to 13830. [2025-04-13 17:25:46,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13830 states, 13813 states have (on average 3.088394990226598) internal successors, (42660), 13829 states have internal predecessors, (42660), 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-04-13 17:25:46,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13830 states to 13830 states and 42660 transitions. [2025-04-13 17:25:47,133 INFO L79 Accepts]: Start accepts. Automaton has 13830 states and 42660 transitions. Word has length 40 [2025-04-13 17:25:47,133 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:47,133 INFO L485 AbstractCegarLoop]: Abstraction has 13830 states and 42660 transitions. [2025-04-13 17:25:47,133 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 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-04-13 17:25:47,134 INFO L278 IsEmpty]: Start isEmpty. Operand 13830 states and 42660 transitions. [2025-04-13 17:25:47,138 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:25:47,138 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:47,138 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:47,138 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 17:25:47,138 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:25:47,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:47,139 INFO L85 PathProgramCache]: Analyzing trace with hash -932028331, now seen corresponding path program 2 times [2025-04-13 17:25:47,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:47,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448350766] [2025-04-13 17:25:47,139 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:25:47,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:47,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:25:47,192 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:25:47,192 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:25:47,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:25:48,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:48,660 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448350766] [2025-04-13 17:25:48,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448350766] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:48,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:48,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:25:48,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156432613] [2025-04-13 17:25:48,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:48,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:25:48,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:48,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:25:48,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:25:48,661 INFO L87 Difference]: Start difference. First operand 13830 states and 42660 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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-04-13 17:25:50,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:50,950 INFO L93 Difference]: Finished difference Result 25684 states and 79544 transitions. [2025-04-13 17:25:50,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 17:25:50,951 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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 40 [2025-04-13 17:25:50,951 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:51,154 INFO L225 Difference]: With dead ends: 25684 [2025-04-13 17:25:51,154 INFO L226 Difference]: Without dead ends: 14529 [2025-04-13 17:25:51,180 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:25:51,180 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 243 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2693 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:51,180 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 0 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2693 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 17:25:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14529 states. [2025-04-13 17:25:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14529 to 13872. [2025-04-13 17:25:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13872 states, 13855 states have (on average 3.0872609166365934) internal successors, (42774), 13871 states have internal predecessors, (42774), 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-04-13 17:25:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13872 states to 13872 states and 42774 transitions. [2025-04-13 17:25:51,581 INFO L79 Accepts]: Start accepts. Automaton has 13872 states and 42774 transitions. Word has length 40 [2025-04-13 17:25:51,581 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:51,581 INFO L485 AbstractCegarLoop]: Abstraction has 13872 states and 42774 transitions. [2025-04-13 17:25:51,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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-04-13 17:25:51,581 INFO L278 IsEmpty]: Start isEmpty. Operand 13872 states and 42774 transitions. [2025-04-13 17:25:51,585 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:25:51,585 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:51,585 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:51,586 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 17:25:51,586 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:25:51,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:51,586 INFO L85 PathProgramCache]: Analyzing trace with hash -886510187, now seen corresponding path program 3 times [2025-04-13 17:25:51,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:51,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029121167] [2025-04-13 17:25:51,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:25:51,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:51,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:25:51,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:25:51,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:25:51,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:25:53,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:53,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029121167] [2025-04-13 17:25:53,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029121167] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:53,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:53,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:25:53,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952077454] [2025-04-13 17:25:53,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:53,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:25:53,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:53,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:25:53,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:25:53,435 INFO L87 Difference]: Start difference. First operand 13872 states and 42774 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:25:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:25:57,614 INFO L93 Difference]: Finished difference Result 25726 states and 79633 transitions. [2025-04-13 17:25:57,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:25:57,615 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:25:57,615 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:25:57,817 INFO L225 Difference]: With dead ends: 25726 [2025-04-13 17:25:57,817 INFO L226 Difference]: Without dead ends: 14727 [2025-04-13 17:25:57,835 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:25:57,836 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 238 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4858 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 4858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:25:57,836 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 0 Invalid, 4897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 4858 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 17:25:57,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14727 states. [2025-04-13 17:25:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14727 to 13896. [2025-04-13 17:25:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13896 states, 13879 states have (on average 3.087398227538007) internal successors, (42850), 13895 states have internal predecessors, (42850), 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-04-13 17:25:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13896 states to 13896 states and 42850 transitions. [2025-04-13 17:25:58,281 INFO L79 Accepts]: Start accepts. Automaton has 13896 states and 42850 transitions. Word has length 40 [2025-04-13 17:25:58,282 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:25:58,282 INFO L485 AbstractCegarLoop]: Abstraction has 13896 states and 42850 transitions. [2025-04-13 17:25:58,282 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:25:58,282 INFO L278 IsEmpty]: Start isEmpty. Operand 13896 states and 42850 transitions. [2025-04-13 17:25:58,286 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:25:58,286 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:25:58,286 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:25:58,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 17:25:58,287 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:25:58,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:25:58,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2073833967, now seen corresponding path program 4 times [2025-04-13 17:25:58,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:25:58,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604927913] [2025-04-13 17:25:58,287 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:25:58,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:25:58,319 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:25:58,351 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:25:58,351 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:25:58,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:25:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:25:59,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:25:59,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604927913] [2025-04-13 17:25:59,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604927913] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:25:59,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:25:59,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-13 17:25:59,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932809342] [2025-04-13 17:25:59,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:25:59,758 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:25:59,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:25:59,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:25:59,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:25:59,759 INFO L87 Difference]: Start difference. First operand 13896 states and 42850 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 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-04-13 17:26:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:03,065 INFO L93 Difference]: Finished difference Result 26592 states and 82257 transitions. [2025-04-13 17:26:03,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:26:03,065 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 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 40 [2025-04-13 17:26:03,065 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:03,316 INFO L225 Difference]: With dead ends: 26592 [2025-04-13 17:26:03,316 INFO L226 Difference]: Without dead ends: 15385 [2025-04-13 17:26:03,333 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:26:03,334 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 284 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3751 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 3751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:03,334 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 0 Invalid, 3821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 3751 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-04-13 17:26:03,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15385 states. [2025-04-13 17:26:03,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15385 to 13998. [2025-04-13 17:26:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13998 states, 13981 states have (on average 3.0846148344181388) internal successors, (43126), 13997 states have internal predecessors, (43126), 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-04-13 17:26:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13998 states to 13998 states and 43126 transitions. [2025-04-13 17:26:03,795 INFO L79 Accepts]: Start accepts. Automaton has 13998 states and 43126 transitions. Word has length 40 [2025-04-13 17:26:03,795 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:03,795 INFO L485 AbstractCegarLoop]: Abstraction has 13998 states and 43126 transitions. [2025-04-13 17:26:03,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 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-04-13 17:26:03,796 INFO L278 IsEmpty]: Start isEmpty. Operand 13998 states and 43126 transitions. [2025-04-13 17:26:03,800 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:26:03,800 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:03,800 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:03,800 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 17:26:03,800 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:26:03,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:03,801 INFO L85 PathProgramCache]: Analyzing trace with hash -940434767, now seen corresponding path program 5 times [2025-04-13 17:26:03,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:03,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775000822] [2025-04-13 17:26:03,801 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:26:03,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:03,831 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:26:03,848 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:26:03,849 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:26:03,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:05,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:26:05,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:05,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775000822] [2025-04-13 17:26:05,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775000822] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:05,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:05,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:26:05,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969295801] [2025-04-13 17:26:05,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:05,749 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:26:05,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:05,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:26:05,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:26:05,749 INFO L87 Difference]: Start difference. First operand 13998 states and 43126 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:26:09,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:09,130 INFO L93 Difference]: Finished difference Result 26348 states and 81384 transitions. [2025-04-13 17:26:09,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:26:09,130 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:26:09,130 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:09,309 INFO L225 Difference]: With dead ends: 26348 [2025-04-13 17:26:09,309 INFO L226 Difference]: Without dead ends: 15249 [2025-04-13 17:26:09,329 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:26:09,329 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 354 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3510 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:09,329 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 0 Invalid, 3581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3510 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-04-13 17:26:09,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15249 states. [2025-04-13 17:26:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15249 to 14010. [2025-04-13 17:26:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14010 states, 13993 states have (on average 3.0842564139212465) internal successors, (43158), 14009 states have internal predecessors, (43158), 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-04-13 17:26:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14010 states to 14010 states and 43158 transitions. [2025-04-13 17:26:09,802 INFO L79 Accepts]: Start accepts. Automaton has 14010 states and 43158 transitions. Word has length 40 [2025-04-13 17:26:09,802 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:09,803 INFO L485 AbstractCegarLoop]: Abstraction has 14010 states and 43158 transitions. [2025-04-13 17:26:09,803 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:26:09,803 INFO L278 IsEmpty]: Start isEmpty. Operand 14010 states and 43158 transitions. [2025-04-13 17:26:09,808 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:26:09,808 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:09,808 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:09,808 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 17:26:09,808 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:26:09,808 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:09,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1625322415, now seen corresponding path program 6 times [2025-04-13 17:26:09,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:09,809 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383729752] [2025-04-13 17:26:09,809 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:26:09,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:09,851 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:26:09,869 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:26:09,870 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:26:09,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:26:11,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:11,639 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383729752] [2025-04-13 17:26:11,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383729752] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:11,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:11,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:26:11,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050444753] [2025-04-13 17:26:11,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:11,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:26:11,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:11,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:26:11,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:26:11,640 INFO L87 Difference]: Start difference. First operand 14010 states and 43158 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:26:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:15,553 INFO L93 Difference]: Finished difference Result 26166 states and 80866 transitions. [2025-04-13 17:26:15,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:26:15,553 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:26:15,553 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:15,818 INFO L225 Difference]: With dead ends: 26166 [2025-04-13 17:26:15,818 INFO L226 Difference]: Without dead ends: 15059 [2025-04-13 17:26:15,837 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:26:15,838 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 257 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4653 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 4653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:15,838 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 0 Invalid, 4699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 4653 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-04-13 17:26:15,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15059 states. [2025-04-13 17:26:16,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15059 to 14040. [2025-04-13 17:26:16,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14040 states, 14023 states have (on average 3.0842187834272266) internal successors, (43250), 14039 states have internal predecessors, (43250), 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-04-13 17:26:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14040 states to 14040 states and 43250 transitions. [2025-04-13 17:26:16,260 INFO L79 Accepts]: Start accepts. Automaton has 14040 states and 43250 transitions. Word has length 40 [2025-04-13 17:26:16,261 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:16,261 INFO L485 AbstractCegarLoop]: Abstraction has 14040 states and 43250 transitions. [2025-04-13 17:26:16,261 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:26:16,261 INFO L278 IsEmpty]: Start isEmpty. Operand 14040 states and 43250 transitions. [2025-04-13 17:26:16,265 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:26:16,265 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:16,265 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:16,265 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 17:26:16,265 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:26:16,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:16,266 INFO L85 PathProgramCache]: Analyzing trace with hash -408104809, now seen corresponding path program 7 times [2025-04-13 17:26:16,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:16,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583141712] [2025-04-13 17:26:16,266 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:26:16,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:16,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 17:26:16,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:26:16,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:16,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:26:18,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:18,287 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583141712] [2025-04-13 17:26:18,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583141712] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:18,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:18,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:26:18,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250483280] [2025-04-13 17:26:18,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:18,287 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:26:18,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:18,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:26:18,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:26:18,288 INFO L87 Difference]: Start difference. First operand 14040 states and 43250 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:26:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:22,261 INFO L93 Difference]: Finished difference Result 26352 states and 81435 transitions. [2025-04-13 17:26:22,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:26:22,261 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:26:22,262 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:22,521 INFO L225 Difference]: With dead ends: 26352 [2025-04-13 17:26:22,521 INFO L226 Difference]: Without dead ends: 15225 [2025-04-13 17:26:22,542 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=687, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:26:22,542 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 321 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4446 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 4446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:22,542 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 0 Invalid, 4519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 4446 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-04-13 17:26:22,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15225 states. [2025-04-13 17:26:22,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15225 to 14028. [2025-04-13 17:26:22,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14028 states, 14011 states have (on average 3.0845764042538004) internal successors, (43218), 14027 states have internal predecessors, (43218), 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-04-13 17:26:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14028 states to 14028 states and 43218 transitions. [2025-04-13 17:26:22,978 INFO L79 Accepts]: Start accepts. Automaton has 14028 states and 43218 transitions. Word has length 40 [2025-04-13 17:26:22,978 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:22,978 INFO L485 AbstractCegarLoop]: Abstraction has 14028 states and 43218 transitions. [2025-04-13 17:26:22,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:26:22,979 INFO L278 IsEmpty]: Start isEmpty. Operand 14028 states and 43218 transitions. [2025-04-13 17:26:22,983 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:26:22,983 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:22,983 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:22,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 17:26:22,984 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:26:22,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:22,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1643395689, now seen corresponding path program 8 times [2025-04-13 17:26:22,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:22,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230597656] [2025-04-13 17:26:22,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:26:22,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:23,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:26:23,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:26:23,045 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:26:23,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:26:24,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:24,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230597656] [2025-04-13 17:26:24,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230597656] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:24,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:24,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:26:24,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591721013] [2025-04-13 17:26:24,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:24,792 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:26:24,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:24,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:26:24,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:26:24,793 INFO L87 Difference]: Start difference. First operand 14028 states and 43218 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:26:28,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:28,603 INFO L93 Difference]: Finished difference Result 26790 states and 82879 transitions. [2025-04-13 17:26:28,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:26:28,603 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:26:28,603 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:28,924 INFO L225 Difference]: With dead ends: 26790 [2025-04-13 17:26:28,925 INFO L226 Difference]: Without dead ends: 15671 [2025-04-13 17:26:28,946 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:26:28,946 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 352 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4475 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 4475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:28,946 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 0 Invalid, 4540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 4475 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-04-13 17:26:28,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15671 states. [2025-04-13 17:26:29,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15671 to 14028. [2025-04-13 17:26:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14028 states, 14011 states have (on average 3.0854328741702948) internal successors, (43230), 14027 states have internal predecessors, (43230), 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-04-13 17:26:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14028 states to 14028 states and 43230 transitions. [2025-04-13 17:26:29,538 INFO L79 Accepts]: Start accepts. Automaton has 14028 states and 43230 transitions. Word has length 40 [2025-04-13 17:26:29,539 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:29,539 INFO L485 AbstractCegarLoop]: Abstraction has 14028 states and 43230 transitions. [2025-04-13 17:26:29,539 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:26:29,539 INFO L278 IsEmpty]: Start isEmpty. Operand 14028 states and 43230 transitions. [2025-04-13 17:26:29,544 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:26:29,544 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:29,544 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:29,544 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 17:26:29,545 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:26:29,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:29,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1573409901, now seen corresponding path program 9 times [2025-04-13 17:26:29,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:29,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747595542] [2025-04-13 17:26:29,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:26:29,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:29,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:26:29,648 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:26:29,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:26:29,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:26:31,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:31,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747595542] [2025-04-13 17:26:31,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747595542] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:31,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:31,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 17:26:31,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308661730] [2025-04-13 17:26:31,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:31,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:26:31,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:31,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:26:31,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:26:31,291 INFO L87 Difference]: Start difference. First operand 14028 states and 43230 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 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-04-13 17:26:33,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:33,588 INFO L93 Difference]: Finished difference Result 25439 states and 78132 transitions. [2025-04-13 17:26:33,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:26:33,589 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 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 40 [2025-04-13 17:26:33,589 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:33,793 INFO L225 Difference]: With dead ends: 25439 [2025-04-13 17:26:33,793 INFO L226 Difference]: Without dead ends: 14128 [2025-04-13 17:26:33,812 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:26:33,813 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:33,813 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 2414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 17:26:33,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14128 states. [2025-04-13 17:26:33,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14128 to 14044. [2025-04-13 17:26:33,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14044 states, 14027 states have (on average 3.0853354245383904) internal successors, (43278), 14043 states have internal predecessors, (43278), 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-04-13 17:26:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14044 states to 14044 states and 43278 transitions. [2025-04-13 17:26:34,184 INFO L79 Accepts]: Start accepts. Automaton has 14044 states and 43278 transitions. Word has length 40 [2025-04-13 17:26:34,185 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:34,185 INFO L485 AbstractCegarLoop]: Abstraction has 14044 states and 43278 transitions. [2025-04-13 17:26:34,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 11 states have internal predecessors, (37), 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-04-13 17:26:34,185 INFO L278 IsEmpty]: Start isEmpty. Operand 14044 states and 43278 transitions. [2025-04-13 17:26:34,188 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:26:34,188 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:34,189 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:34,189 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 17:26:34,189 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:26:34,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:34,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1577085111, now seen corresponding path program 10 times [2025-04-13 17:26:34,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:34,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882528868] [2025-04-13 17:26:34,189 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:26:34,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:34,215 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:26:34,244 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:26:34,244 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:26:34,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:26:35,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:35,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882528868] [2025-04-13 17:26:35,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882528868] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:35,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:35,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:26:35,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830424329] [2025-04-13 17:26:35,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:35,817 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:26:35,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:35,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:26:35,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:26:35,817 INFO L87 Difference]: Start difference. First operand 14044 states and 43278 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:26:39,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:39,822 INFO L93 Difference]: Finished difference Result 27364 states and 84721 transitions. [2025-04-13 17:26:39,823 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 17:26:39,823 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:26:39,823 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:40,065 INFO L225 Difference]: With dead ends: 27364 [2025-04-13 17:26:40,065 INFO L226 Difference]: Without dead ends: 16053 [2025-04-13 17:26:40,087 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:26:40,087 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 358 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4352 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 4352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:40,087 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 0 Invalid, 4449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 4352 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-04-13 17:26:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16053 states. [2025-04-13 17:26:40,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16053 to 14194. [2025-04-13 17:26:40,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14194 states, 14177 states have (on average 3.0811878394582775) internal successors, (43682), 14193 states have internal predecessors, (43682), 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-04-13 17:26:40,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14194 states to 14194 states and 43682 transitions. [2025-04-13 17:26:40,551 INFO L79 Accepts]: Start accepts. Automaton has 14194 states and 43682 transitions. Word has length 40 [2025-04-13 17:26:40,551 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:40,551 INFO L485 AbstractCegarLoop]: Abstraction has 14194 states and 43682 transitions. [2025-04-13 17:26:40,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:26:40,551 INFO L278 IsEmpty]: Start isEmpty. Operand 14194 states and 43682 transitions. [2025-04-13 17:26:40,555 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:26:40,555 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:40,555 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:40,555 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 17:26:40,555 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:26:40,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:40,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1124898349, now seen corresponding path program 11 times [2025-04-13 17:26:40,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:40,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971623443] [2025-04-13 17:26:40,556 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:26:40,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:40,583 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:26:40,693 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:26:40,693 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:26:40,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:42,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:26:42,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:42,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971623443] [2025-04-13 17:26:42,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971623443] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:42,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:42,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:26:42,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738185155] [2025-04-13 17:26:42,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:42,427 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:26:42,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:42,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:26:42,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:26:42,428 INFO L87 Difference]: Start difference. First operand 14194 states and 43682 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:26:46,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:46,489 INFO L93 Difference]: Finished difference Result 26608 states and 82136 transitions. [2025-04-13 17:26:46,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:26:46,489 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:26:46,489 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:46,711 INFO L225 Difference]: With dead ends: 26608 [2025-04-13 17:26:46,712 INFO L226 Difference]: Without dead ends: 15373 [2025-04-13 17:26:46,734 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:26:46,734 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4257 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:46,734 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 4312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 4257 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 17:26:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15373 states. [2025-04-13 17:26:46,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15373 to 14200. [2025-04-13 17:26:46,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14200 states, 14183 states have (on average 3.0810124797292535) internal successors, (43698), 14199 states have internal predecessors, (43698), 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-04-13 17:26:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14200 states to 14200 states and 43698 transitions. [2025-04-13 17:26:47,194 INFO L79 Accepts]: Start accepts. Automaton has 14200 states and 43698 transitions. Word has length 40 [2025-04-13 17:26:47,194 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:47,194 INFO L485 AbstractCegarLoop]: Abstraction has 14200 states and 43698 transitions. [2025-04-13 17:26:47,194 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:26:47,194 INFO L278 IsEmpty]: Start isEmpty. Operand 14200 states and 43698 transitions. [2025-04-13 17:26:47,198 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:26:47,198 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:47,198 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:47,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 17:26:47,198 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:26:47,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:47,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1934778067, now seen corresponding path program 12 times [2025-04-13 17:26:47,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:47,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004551553] [2025-04-13 17:26:47,199 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:26:47,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:47,228 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:26:47,249 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:26:47,249 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:26:47,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:26:49,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:49,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004551553] [2025-04-13 17:26:49,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004551553] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:49,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:49,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:26:49,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989603184] [2025-04-13 17:26:49,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:49,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:26:49,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:49,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:26:49,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:26:49,321 INFO L87 Difference]: Start difference. First operand 14200 states and 43698 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:26:52,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:52,913 INFO L93 Difference]: Finished difference Result 26658 states and 82301 transitions. [2025-04-13 17:26:52,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:26:52,914 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:26:52,914 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:53,177 INFO L225 Difference]: With dead ends: 26658 [2025-04-13 17:26:53,178 INFO L226 Difference]: Without dead ends: 15419 [2025-04-13 17:26:53,197 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:26:53,199 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 333 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3745 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:53,199 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 0 Invalid, 3825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3745 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 17:26:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15419 states. [2025-04-13 17:26:53,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15419 to 14170. [2025-04-13 17:26:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14170 states, 14153 states have (on average 3.0818907652087897) internal successors, (43618), 14169 states have internal predecessors, (43618), 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-04-13 17:26:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14170 states to 14170 states and 43618 transitions. [2025-04-13 17:26:53,667 INFO L79 Accepts]: Start accepts. Automaton has 14170 states and 43618 transitions. Word has length 40 [2025-04-13 17:26:53,667 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:53,667 INFO L485 AbstractCegarLoop]: Abstraction has 14170 states and 43618 transitions. [2025-04-13 17:26:53,667 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:26:53,667 INFO L278 IsEmpty]: Start isEmpty. Operand 14170 states and 43618 transitions. [2025-04-13 17:26:53,671 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:26:53,671 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:53,671 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:53,671 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 17:26:53,672 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:26:53,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:53,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1289115951, now seen corresponding path program 13 times [2025-04-13 17:26:53,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:53,672 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295747432] [2025-04-13 17:26:53,672 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:26:53,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:53,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 17:26:53,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:26:53,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:53,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:55,584 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:26:55,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:55,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295747432] [2025-04-13 17:26:55,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295747432] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:55,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:55,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:26:55,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35465229] [2025-04-13 17:26:55,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:55,584 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:26:55,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:55,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:26:55,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:26:55,585 INFO L87 Difference]: Start difference. First operand 14170 states and 43618 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:27:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:00,502 INFO L93 Difference]: Finished difference Result 26450 states and 81712 transitions. [2025-04-13 17:27:00,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:27:00,503 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:27:00,503 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:00,798 INFO L225 Difference]: With dead ends: 26450 [2025-04-13 17:27:00,798 INFO L226 Difference]: Without dead ends: 15231 [2025-04-13 17:27:00,815 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2025-04-13 17:27:00,816 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 240 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5572 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 5572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:00,816 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 0 Invalid, 5633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 5572 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-04-13 17:27:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15231 states. [2025-04-13 17:27:01,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15231 to 14146. [2025-04-13 17:27:01,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14146 states, 14129 states have (on average 3.082596078986482) internal successors, (43554), 14145 states have internal predecessors, (43554), 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-04-13 17:27:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14146 states to 14146 states and 43554 transitions. [2025-04-13 17:27:01,293 INFO L79 Accepts]: Start accepts. Automaton has 14146 states and 43554 transitions. Word has length 40 [2025-04-13 17:27:01,293 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:01,293 INFO L485 AbstractCegarLoop]: Abstraction has 14146 states and 43554 transitions. [2025-04-13 17:27:01,293 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:27:01,293 INFO L278 IsEmpty]: Start isEmpty. Operand 14146 states and 43554 transitions. [2025-04-13 17:27:01,298 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:27:01,298 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:01,298 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:01,298 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 17:27:01,298 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:27:01,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:01,299 INFO L85 PathProgramCache]: Analyzing trace with hash -54584717, now seen corresponding path program 14 times [2025-04-13 17:27:01,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:01,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587417481] [2025-04-13 17:27:01,299 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:27:01,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:01,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:27:01,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:27:01,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:27:01,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:27:03,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:03,532 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587417481] [2025-04-13 17:27:03,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587417481] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:03,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:03,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:27:03,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658062016] [2025-04-13 17:27:03,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:03,532 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:27:03,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:03,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:27:03,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:27:03,533 INFO L87 Difference]: Start difference. First operand 14146 states and 43554 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:27:06,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:06,727 INFO L93 Difference]: Finished difference Result 26328 states and 81377 transitions. [2025-04-13 17:27:06,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:27:06,727 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:27:06,727 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:06,974 INFO L225 Difference]: With dead ends: 26328 [2025-04-13 17:27:06,974 INFO L226 Difference]: Without dead ends: 15125 [2025-04-13 17:27:06,998 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:27:06,998 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 231 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3375 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:06,999 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 0 Invalid, 3433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3375 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-04-13 17:27:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15125 states. [2025-04-13 17:27:07,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15125 to 14144. [2025-04-13 17:27:07,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14144 states, 14127 states have (on average 3.083244850286685) internal successors, (43557), 14143 states have internal predecessors, (43557), 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-04-13 17:27:07,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14144 states to 14144 states and 43557 transitions. [2025-04-13 17:27:07,483 INFO L79 Accepts]: Start accepts. Automaton has 14144 states and 43557 transitions. Word has length 40 [2025-04-13 17:27:07,483 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:07,483 INFO L485 AbstractCegarLoop]: Abstraction has 14144 states and 43557 transitions. [2025-04-13 17:27:07,483 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:27:07,483 INFO L278 IsEmpty]: Start isEmpty. Operand 14144 states and 43557 transitions. [2025-04-13 17:27:07,488 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:27:07,488 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:07,488 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:07,488 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 17:27:07,488 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:27:07,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:07,488 INFO L85 PathProgramCache]: Analyzing trace with hash 952453225, now seen corresponding path program 15 times [2025-04-13 17:27:07,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:07,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897575600] [2025-04-13 17:27:07,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:27:07,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:07,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:27:07,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:27:07,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:27:07,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:09,200 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:27:09,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:09,200 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897575600] [2025-04-13 17:27:09,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897575600] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:09,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:09,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:27:09,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192800937] [2025-04-13 17:27:09,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:09,201 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:27:09,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:09,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:27:09,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:27:09,201 INFO L87 Difference]: Start difference. First operand 14144 states and 43557 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:27:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:12,667 INFO L93 Difference]: Finished difference Result 26468 states and 81813 transitions. [2025-04-13 17:27:12,668 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:27:12,668 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:27:12,668 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:13,000 INFO L225 Difference]: With dead ends: 26468 [2025-04-13 17:27:13,001 INFO L226 Difference]: Without dead ends: 15265 [2025-04-13 17:27:13,019 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:27:13,020 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 254 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3952 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:13,020 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 0 Invalid, 4014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 3952 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 17:27:13,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15265 states. [2025-04-13 17:27:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15265 to 14138. [2025-04-13 17:27:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14138 states, 14121 states have (on average 3.0834218539763474) internal successors, (43541), 14137 states have internal predecessors, (43541), 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-04-13 17:27:13,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14138 states to 14138 states and 43541 transitions. [2025-04-13 17:27:13,533 INFO L79 Accepts]: Start accepts. Automaton has 14138 states and 43541 transitions. Word has length 40 [2025-04-13 17:27:13,534 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:13,534 INFO L485 AbstractCegarLoop]: Abstraction has 14138 states and 43541 transitions. [2025-04-13 17:27:13,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:27:13,534 INFO L278 IsEmpty]: Start isEmpty. Operand 14138 states and 43541 transitions. [2025-04-13 17:27:13,538 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:27:13,538 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:13,538 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:13,538 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 17:27:13,538 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:27:13,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:13,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1804070835, now seen corresponding path program 16 times [2025-04-13 17:27:13,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:13,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165908313] [2025-04-13 17:27:13,539 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:27:13,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:13,570 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:27:13,616 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:27:13,616 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:27:13,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:27:15,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:15,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165908313] [2025-04-13 17:27:15,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165908313] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:15,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:15,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:27:15,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836706654] [2025-04-13 17:27:15,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:15,396 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:27:15,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:15,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:27:15,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:27:15,396 INFO L87 Difference]: Start difference. First operand 14138 states and 43541 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:27:18,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:18,638 INFO L93 Difference]: Finished difference Result 26458 states and 81742 transitions. [2025-04-13 17:27:18,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 17:27:18,638 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:27:18,638 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:18,939 INFO L225 Difference]: With dead ends: 26458 [2025-04-13 17:27:18,939 INFO L226 Difference]: Without dead ends: 15259 [2025-04-13 17:27:18,957 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:27:18,958 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 286 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3735 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:18,958 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 0 Invalid, 3772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3735 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-04-13 17:27:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15259 states. [2025-04-13 17:27:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15259 to 14132. [2025-04-13 17:27:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14132 states, 14115 states have (on average 3.083599008147361) internal successors, (43525), 14131 states have internal predecessors, (43525), 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-04-13 17:27:19,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14132 states to 14132 states and 43525 transitions. [2025-04-13 17:27:19,482 INFO L79 Accepts]: Start accepts. Automaton has 14132 states and 43525 transitions. Word has length 40 [2025-04-13 17:27:19,483 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:19,483 INFO L485 AbstractCegarLoop]: Abstraction has 14132 states and 43525 transitions. [2025-04-13 17:27:19,483 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:27:19,483 INFO L278 IsEmpty]: Start isEmpty. Operand 14132 states and 43525 transitions. [2025-04-13 17:27:19,488 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:27:19,488 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:19,488 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:19,488 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 17:27:19,488 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:27:19,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:19,489 INFO L85 PathProgramCache]: Analyzing trace with hash 974066567, now seen corresponding path program 17 times [2025-04-13 17:27:19,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:19,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068474224] [2025-04-13 17:27:19,489 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:27:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:19,526 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:27:19,545 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:27:19,545 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:27:19,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:27:21,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:21,628 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068474224] [2025-04-13 17:27:21,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068474224] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:21,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:21,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:27:21,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798098372] [2025-04-13 17:27:21,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:21,629 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:27:21,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:21,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:27:21,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:27:21,629 INFO L87 Difference]: Start difference. First operand 14132 states and 43525 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:27:24,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:24,664 INFO L93 Difference]: Finished difference Result 26490 states and 81835 transitions. [2025-04-13 17:27:24,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 17:27:24,664 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:27:24,665 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:24,919 INFO L225 Difference]: With dead ends: 26490 [2025-04-13 17:27:24,920 INFO L226 Difference]: Without dead ends: 15295 [2025-04-13 17:27:24,944 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:27:24,944 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 304 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3575 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:24,944 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 0 Invalid, 3611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3575 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-04-13 17:27:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15295 states. [2025-04-13 17:27:25,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15295 to 14156. [2025-04-13 17:27:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14156 states, 14139 states have (on average 3.0837400099016903) internal successors, (43601), 14155 states have internal predecessors, (43601), 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-04-13 17:27:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14156 states to 14156 states and 43601 transitions. [2025-04-13 17:27:25,457 INFO L79 Accepts]: Start accepts. Automaton has 14156 states and 43601 transitions. Word has length 40 [2025-04-13 17:27:25,457 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:25,457 INFO L485 AbstractCegarLoop]: Abstraction has 14156 states and 43601 transitions. [2025-04-13 17:27:25,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:27:25,458 INFO L278 IsEmpty]: Start isEmpty. Operand 14156 states and 43601 transitions. [2025-04-13 17:27:25,462 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:27:25,462 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:25,462 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:25,462 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 17:27:25,462 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:27:25,462 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:25,462 INFO L85 PathProgramCache]: Analyzing trace with hash 865848789, now seen corresponding path program 18 times [2025-04-13 17:27:25,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:25,462 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432224975] [2025-04-13 17:27:25,462 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:27:25,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:25,490 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:27:25,502 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:27:25,502 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:27:25,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:27,226 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:27:27,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:27,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432224975] [2025-04-13 17:27:27,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432224975] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:27,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:27,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:27:27,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501682621] [2025-04-13 17:27:27,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:27,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:27:27,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:27,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:27:27,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:27:27,227 INFO L87 Difference]: Start difference. First operand 14156 states and 43601 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:27:29,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:29,975 INFO L93 Difference]: Finished difference Result 27042 states and 83599 transitions. [2025-04-13 17:27:29,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:27:29,976 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:27:29,976 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:30,393 INFO L225 Difference]: With dead ends: 27042 [2025-04-13 17:27:30,393 INFO L226 Difference]: Without dead ends: 15831 [2025-04-13 17:27:30,413 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:27:30,413 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 345 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3309 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 3309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:30,413 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 0 Invalid, 3354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 3309 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-04-13 17:27:30,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15831 states. [2025-04-13 17:27:30,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15831 to 14174. [2025-04-13 17:27:30,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14174 states, 14157 states have (on average 3.0829271738362647) internal successors, (43645), 14173 states have internal predecessors, (43645), 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-04-13 17:27:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14174 states to 14174 states and 43645 transitions. [2025-04-13 17:27:30,928 INFO L79 Accepts]: Start accepts. Automaton has 14174 states and 43645 transitions. Word has length 40 [2025-04-13 17:27:30,929 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:30,929 INFO L485 AbstractCegarLoop]: Abstraction has 14174 states and 43645 transitions. [2025-04-13 17:27:30,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:27:30,929 INFO L278 IsEmpty]: Start isEmpty. Operand 14174 states and 43645 transitions. [2025-04-13 17:27:30,933 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:27:30,933 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:30,933 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:30,934 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 17:27:30,934 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:27:30,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:30,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1887885205, now seen corresponding path program 19 times [2025-04-13 17:27:30,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:30,934 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156526095] [2025-04-13 17:27:30,934 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:27:30,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:30,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 17:27:30,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:27:30,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:27:30,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:27:32,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:32,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156526095] [2025-04-13 17:27:32,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156526095] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:32,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:32,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:27:32,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541537108] [2025-04-13 17:27:32,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:32,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:27:32,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:32,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:27:32,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:27:32,639 INFO L87 Difference]: Start difference. First operand 14174 states and 43645 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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-04-13 17:27:35,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:35,732 INFO L93 Difference]: Finished difference Result 26602 states and 82159 transitions. [2025-04-13 17:27:35,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:27:35,732 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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 40 [2025-04-13 17:27:35,733 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:36,036 INFO L225 Difference]: With dead ends: 26602 [2025-04-13 17:27:36,036 INFO L226 Difference]: Without dead ends: 15187 [2025-04-13 17:27:36,076 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:27:36,077 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 182 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3456 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:36,077 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 0 Invalid, 3496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3456 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-04-13 17:27:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15187 states. [2025-04-13 17:27:36,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15187 to 14198. [2025-04-13 17:27:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14198 states, 14181 states have (on average 3.082222692334814) internal successors, (43709), 14197 states have internal predecessors, (43709), 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-04-13 17:27:36,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14198 states to 14198 states and 43709 transitions. [2025-04-13 17:27:36,619 INFO L79 Accepts]: Start accepts. Automaton has 14198 states and 43709 transitions. Word has length 40 [2025-04-13 17:27:36,619 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:36,619 INFO L485 AbstractCegarLoop]: Abstraction has 14198 states and 43709 transitions. [2025-04-13 17:27:36,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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-04-13 17:27:36,619 INFO L278 IsEmpty]: Start isEmpty. Operand 14198 states and 43709 transitions. [2025-04-13 17:27:36,623 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:27:36,623 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:36,624 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:36,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 17:27:36,624 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:27:36,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:36,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1171791211, now seen corresponding path program 20 times [2025-04-13 17:27:36,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:36,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411073785] [2025-04-13 17:27:36,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:27:36,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:36,652 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:27:36,781 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:27:36,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:27:36,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:38,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:27:38,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:38,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411073785] [2025-04-13 17:27:38,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411073785] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:38,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:38,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:27:38,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45615628] [2025-04-13 17:27:38,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:38,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:27:38,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:38,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:27:38,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:27:38,115 INFO L87 Difference]: Start difference. First operand 14198 states and 43709 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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-04-13 17:27:41,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:41,639 INFO L93 Difference]: Finished difference Result 26944 states and 83134 transitions. [2025-04-13 17:27:41,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:27:41,640 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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 40 [2025-04-13 17:27:41,640 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:41,931 INFO L225 Difference]: With dead ends: 26944 [2025-04-13 17:27:41,931 INFO L226 Difference]: Without dead ends: 15513 [2025-04-13 17:27:41,964 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:27:41,965 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 187 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4072 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 4072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:41,965 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 0 Invalid, 4116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 4072 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 17:27:41,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15513 states. [2025-04-13 17:27:42,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15513 to 14210. [2025-04-13 17:27:42,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14210 states, 14193 states have (on average 3.08187134502924) internal successors, (43741), 14209 states have internal predecessors, (43741), 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-04-13 17:27:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14210 states to 14210 states and 43741 transitions. [2025-04-13 17:27:42,490 INFO L79 Accepts]: Start accepts. Automaton has 14210 states and 43741 transitions. Word has length 40 [2025-04-13 17:27:42,490 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:42,490 INFO L485 AbstractCegarLoop]: Abstraction has 14210 states and 43741 transitions. [2025-04-13 17:27:42,490 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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-04-13 17:27:42,490 INFO L278 IsEmpty]: Start isEmpty. Operand 14210 states and 43741 transitions. [2025-04-13 17:27:42,495 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:27:42,495 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:42,495 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:42,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-13 17:27:42,495 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:27:42,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:42,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1623977973, now seen corresponding path program 21 times [2025-04-13 17:27:42,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:42,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371508595] [2025-04-13 17:27:42,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:27:42,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:42,527 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:27:42,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:27:42,547 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:27:42,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:27:44,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:44,267 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371508595] [2025-04-13 17:27:44,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371508595] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:44,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:44,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:27:44,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079009621] [2025-04-13 17:27:44,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:44,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:27:44,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:44,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:27:44,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:27:44,268 INFO L87 Difference]: Start difference. First operand 14210 states and 43741 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:27:48,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:48,312 INFO L93 Difference]: Finished difference Result 26728 states and 82483 transitions. [2025-04-13 17:27:48,313 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:27:48,313 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:27:48,313 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:48,626 INFO L225 Difference]: With dead ends: 26728 [2025-04-13 17:27:48,626 INFO L226 Difference]: Without dead ends: 15481 [2025-04-13 17:27:48,654 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:27:48,655 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 188 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4510 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 4510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:48,655 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 0 Invalid, 4549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 4510 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 17:27:48,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15481 states. [2025-04-13 17:27:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15481 to 14216. [2025-04-13 17:27:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14216 states, 14199 states have (on average 3.081695894077048) internal successors, (43757), 14215 states have internal predecessors, (43757), 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-04-13 17:27:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 43757 transitions. [2025-04-13 17:27:49,415 INFO L79 Accepts]: Start accepts. Automaton has 14216 states and 43757 transitions. Word has length 40 [2025-04-13 17:27:49,416 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:49,416 INFO L485 AbstractCegarLoop]: Abstraction has 14216 states and 43757 transitions. [2025-04-13 17:27:49,416 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:27:49,416 INFO L278 IsEmpty]: Start isEmpty. Operand 14216 states and 43757 transitions. [2025-04-13 17:27:49,421 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:27:49,421 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:49,421 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:49,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-13 17:27:49,421 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:27:49,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:49,422 INFO L85 PathProgramCache]: Analyzing trace with hash 388687093, now seen corresponding path program 22 times [2025-04-13 17:27:49,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:49,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991281448] [2025-04-13 17:27:49,422 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:27:49,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:49,466 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:27:49,523 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:27:49,524 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:27:49,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:27:51,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:51,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991281448] [2025-04-13 17:27:51,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991281448] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:51,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:51,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:27:51,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259816444] [2025-04-13 17:27:51,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:51,444 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:27:51,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:51,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:27:51,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:27:51,445 INFO L87 Difference]: Start difference. First operand 14216 states and 43757 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:27:56,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:56,413 INFO L93 Difference]: Finished difference Result 26816 states and 82745 transitions. [2025-04-13 17:27:56,414 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:27:56,414 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:27:56,414 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:56,688 INFO L225 Difference]: With dead ends: 26816 [2025-04-13 17:27:56,688 INFO L226 Difference]: Without dead ends: 15565 [2025-04-13 17:27:56,710 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:27:56,710 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 196 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5758 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 5758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:56,710 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 0 Invalid, 5801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 5758 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-04-13 17:27:56,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15565 states. [2025-04-13 17:27:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15565 to 14204. [2025-04-13 17:27:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14204 states, 14187 states have (on average 3.0820469443857053) internal successors, (43725), 14203 states have internal predecessors, (43725), 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-04-13 17:27:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14204 states to 14204 states and 43725 transitions. [2025-04-13 17:27:57,195 INFO L79 Accepts]: Start accepts. Automaton has 14204 states and 43725 transitions. Word has length 40 [2025-04-13 17:27:57,195 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:57,195 INFO L485 AbstractCegarLoop]: Abstraction has 14204 states and 43725 transitions. [2025-04-13 17:27:57,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:27:57,195 INFO L278 IsEmpty]: Start isEmpty. Operand 14204 states and 43725 transitions. [2025-04-13 17:27:57,199 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:27:57,199 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:27:57,199 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:27:57,199 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-13 17:27:57,199 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:27:57,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:27:57,200 INFO L85 PathProgramCache]: Analyzing trace with hash 536096917, now seen corresponding path program 23 times [2025-04-13 17:27:57,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:27:57,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206814635] [2025-04-13 17:27:57,200 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:27:57,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:27:57,229 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:27:57,249 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:27:57,249 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:27:57,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:27:59,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:27:59,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:27:59,124 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206814635] [2025-04-13 17:27:59,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206814635] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:27:59,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:27:59,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:27:59,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504949003] [2025-04-13 17:27:59,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:27:59,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:27:59,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:27:59,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:27:59,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:27:59,125 INFO L87 Difference]: Start difference. First operand 14204 states and 43725 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:28:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:03,332 INFO L93 Difference]: Finished difference Result 26784 states and 82668 transitions. [2025-04-13 17:28:03,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:28:03,332 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:28:03,332 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:03,631 INFO L225 Difference]: With dead ends: 26784 [2025-04-13 17:28:03,632 INFO L226 Difference]: Without dead ends: 15541 [2025-04-13 17:28:03,654 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:28:03,655 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 197 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4750 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 4750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:03,655 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 0 Invalid, 4791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 4750 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 17:28:03,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15541 states. [2025-04-13 17:28:03,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15541 to 14198. [2025-04-13 17:28:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14198 states, 14181 states have (on average 3.082222692334814) internal successors, (43709), 14197 states have internal predecessors, (43709), 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-04-13 17:28:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14198 states to 14198 states and 43709 transitions. [2025-04-13 17:28:04,183 INFO L79 Accepts]: Start accepts. Automaton has 14198 states and 43709 transitions. Word has length 40 [2025-04-13 17:28:04,183 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:04,183 INFO L485 AbstractCegarLoop]: Abstraction has 14198 states and 43709 transitions. [2025-04-13 17:28:04,183 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:28:04,183 INFO L278 IsEmpty]: Start isEmpty. Operand 14198 states and 43709 transitions. [2025-04-13 17:28:04,187 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:28:04,187 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:04,187 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:04,187 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-13 17:28:04,187 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:28:04,187 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:04,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1459760371, now seen corresponding path program 24 times [2025-04-13 17:28:04,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:04,188 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135535252] [2025-04-13 17:28:04,188 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:28:04,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:04,216 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:28:04,233 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:28:04,233 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:28:04,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:06,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:28:06,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:06,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135535252] [2025-04-13 17:28:06,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135535252] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:06,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:06,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:28:06,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903434074] [2025-04-13 17:28:06,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:06,069 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:28:06,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:06,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:28:06,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:28:06,069 INFO L87 Difference]: Start difference. First operand 14198 states and 43709 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:28:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:10,316 INFO L93 Difference]: Finished difference Result 26814 states and 82772 transitions. [2025-04-13 17:28:10,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:28:10,317 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:28:10,317 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:10,632 INFO L225 Difference]: With dead ends: 26814 [2025-04-13 17:28:10,633 INFO L226 Difference]: Without dead ends: 15575 [2025-04-13 17:28:10,656 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:28:10,657 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 194 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4746 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:10,657 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 0 Invalid, 4789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4746 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-04-13 17:28:10,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15575 states. [2025-04-13 17:28:10,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15575 to 14174. [2025-04-13 17:28:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14174 states, 14157 states have (on average 3.0829271738362647) internal successors, (43645), 14173 states have internal predecessors, (43645), 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-04-13 17:28:10,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14174 states to 14174 states and 43645 transitions. [2025-04-13 17:28:11,183 INFO L79 Accepts]: Start accepts. Automaton has 14174 states and 43645 transitions. Word has length 40 [2025-04-13 17:28:11,184 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:11,184 INFO L485 AbstractCegarLoop]: Abstraction has 14174 states and 43645 transitions. [2025-04-13 17:28:11,184 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:28:11,184 INFO L278 IsEmpty]: Start isEmpty. Operand 14174 states and 43645 transitions. [2025-04-13 17:28:11,188 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:28:11,189 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:11,189 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:11,189 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-13 17:28:11,189 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:28:11,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:11,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1031840407, now seen corresponding path program 25 times [2025-04-13 17:28:11,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:11,189 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392102814] [2025-04-13 17:28:11,189 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:28:11,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:11,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 17:28:11,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:28:11,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:28:11,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:28:13,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:13,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392102814] [2025-04-13 17:28:13,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392102814] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:13,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:13,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:28:13,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550723805] [2025-04-13 17:28:13,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:13,195 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:28:13,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:13,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:28:13,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:28:13,195 INFO L87 Difference]: Start difference. First operand 14174 states and 43645 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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-04-13 17:28:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:16,136 INFO L93 Difference]: Finished difference Result 26518 states and 81931 transitions. [2025-04-13 17:28:16,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:28:16,136 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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 40 [2025-04-13 17:28:16,136 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:16,413 INFO L225 Difference]: With dead ends: 26518 [2025-04-13 17:28:16,413 INFO L226 Difference]: Without dead ends: 15103 [2025-04-13 17:28:16,434 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:28:16,435 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 151 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3333 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:16,435 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 0 Invalid, 3366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3333 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-04-13 17:28:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15103 states. [2025-04-13 17:28:16,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15103 to 14162. [2025-04-13 17:28:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14162 states, 14145 states have (on average 3.083138918345705) internal successors, (43611), 14161 states have internal predecessors, (43611), 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-04-13 17:28:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14162 states to 14162 states and 43611 transitions. [2025-04-13 17:28:17,026 INFO L79 Accepts]: Start accepts. Automaton has 14162 states and 43611 transitions. Word has length 40 [2025-04-13 17:28:17,026 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:17,026 INFO L485 AbstractCegarLoop]: Abstraction has 14162 states and 43611 transitions. [2025-04-13 17:28:17,026 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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-04-13 17:28:17,026 INFO L278 IsEmpty]: Start isEmpty. Operand 14162 states and 43611 transitions. [2025-04-13 17:28:17,030 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:28:17,030 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:17,030 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:17,030 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-13 17:28:17,030 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:28:17,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:17,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1814944525, now seen corresponding path program 26 times [2025-04-13 17:28:17,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:17,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155156760] [2025-04-13 17:28:17,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:28:17,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:17,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:28:17,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:28:17,082 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:28:17,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:18,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:28:18,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:18,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155156760] [2025-04-13 17:28:18,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155156760] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:18,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:18,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:28:18,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249072732] [2025-04-13 17:28:18,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:18,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:28:18,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:18,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:28:18,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:28:18,780 INFO L87 Difference]: Start difference. First operand 14162 states and 43611 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:28:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:21,915 INFO L93 Difference]: Finished difference Result 26590 states and 82109 transitions. [2025-04-13 17:28:21,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 17:28:21,916 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:28:21,916 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:22,231 INFO L225 Difference]: With dead ends: 26590 [2025-04-13 17:28:22,231 INFO L226 Difference]: Without dead ends: 15383 [2025-04-13 17:28:22,257 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:28:22,257 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 191 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3661 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:22,257 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 0 Invalid, 3702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3661 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-04-13 17:28:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15383 states. [2025-04-13 17:28:22,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15383 to 14132. [2025-04-13 17:28:22,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14132 states, 14115 states have (on average 3.084024087849805) internal successors, (43531), 14131 states have internal predecessors, (43531), 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-04-13 17:28:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14132 states to 14132 states and 43531 transitions. [2025-04-13 17:28:22,782 INFO L79 Accepts]: Start accepts. Automaton has 14132 states and 43531 transitions. Word has length 40 [2025-04-13 17:28:22,782 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:22,782 INFO L485 AbstractCegarLoop]: Abstraction has 14132 states and 43531 transitions. [2025-04-13 17:28:22,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:28:22,782 INFO L278 IsEmpty]: Start isEmpty. Operand 14132 states and 43531 transitions. [2025-04-13 17:28:22,786 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:28:22,786 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:22,786 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:22,786 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 17:28:22,786 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:28:22,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:22,787 INFO L85 PathProgramCache]: Analyzing trace with hash -264472183, now seen corresponding path program 27 times [2025-04-13 17:28:22,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:22,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618804495] [2025-04-13 17:28:22,787 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:28:22,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:22,816 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:28:22,831 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:28:22,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:28:22,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:28:24,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:24,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618804495] [2025-04-13 17:28:24,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618804495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:24,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:24,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:28:24,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966749517] [2025-04-13 17:28:24,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:24,180 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:28:24,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:24,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:28:24,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:28:24,180 INFO L87 Difference]: Start difference. First operand 14132 states and 43531 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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-04-13 17:28:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:27,635 INFO L93 Difference]: Finished difference Result 26816 states and 82791 transitions. [2025-04-13 17:28:27,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:28:27,636 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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 40 [2025-04-13 17:28:27,636 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:27,945 INFO L225 Difference]: With dead ends: 26816 [2025-04-13 17:28:27,945 INFO L226 Difference]: Without dead ends: 15437 [2025-04-13 17:28:27,969 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:28:27,969 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 199 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3851 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:27,969 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 0 Invalid, 3902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3851 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 17:28:27,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15437 states. [2025-04-13 17:28:28,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15437 to 14216. [2025-04-13 17:28:28,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14216 states, 14199 states have (on average 3.0829635889851397) internal successors, (43775), 14215 states have internal predecessors, (43775), 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-04-13 17:28:28,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 43775 transitions. [2025-04-13 17:28:28,551 INFO L79 Accepts]: Start accepts. Automaton has 14216 states and 43775 transitions. Word has length 40 [2025-04-13 17:28:28,552 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:28,552 INFO L485 AbstractCegarLoop]: Abstraction has 14216 states and 43775 transitions. [2025-04-13 17:28:28,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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-04-13 17:28:28,552 INFO L278 IsEmpty]: Start isEmpty. Operand 14216 states and 43775 transitions. [2025-04-13 17:28:28,556 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:28:28,556 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:28,556 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:28,556 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 17:28:28,556 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:28:28,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:28,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2135457357, now seen corresponding path program 28 times [2025-04-13 17:28:28,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:28,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752788105] [2025-04-13 17:28:28,556 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:28:28,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:28,702 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:28:28,733 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:28:28,733 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:28:28,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:30,537 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:28:30,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:30,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752788105] [2025-04-13 17:28:30,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752788105] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:30,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:30,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:28:30,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552013479] [2025-04-13 17:28:30,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:30,538 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:28:30,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:30,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:28:30,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:28:30,539 INFO L87 Difference]: Start difference. First operand 14216 states and 43775 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:28:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:34,760 INFO L93 Difference]: Finished difference Result 26742 states and 82558 transitions. [2025-04-13 17:28:34,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:28:34,760 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:28:34,761 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:35,097 INFO L225 Difference]: With dead ends: 26742 [2025-04-13 17:28:35,097 INFO L226 Difference]: Without dead ends: 15483 [2025-04-13 17:28:35,126 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:28:35,126 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 234 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4826 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 4826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:35,126 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 0 Invalid, 4879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 4826 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 17:28:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15483 states. [2025-04-13 17:28:35,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15483 to 14204. [2025-04-13 17:28:35,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14204 states, 14187 states have (on average 3.0833157115669274) internal successors, (43743), 14203 states have internal predecessors, (43743), 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-04-13 17:28:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14204 states to 14204 states and 43743 transitions. [2025-04-13 17:28:35,711 INFO L79 Accepts]: Start accepts. Automaton has 14204 states and 43743 transitions. Word has length 40 [2025-04-13 17:28:35,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:35,711 INFO L485 AbstractCegarLoop]: Abstraction has 14204 states and 43743 transitions. [2025-04-13 17:28:35,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:28:35,711 INFO L278 IsEmpty]: Start isEmpty. Operand 14204 states and 43743 transitions. [2025-04-13 17:28:35,715 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:28:35,715 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:35,715 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:35,715 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-13 17:28:35,715 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:28:35,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:35,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1064384079, now seen corresponding path program 29 times [2025-04-13 17:28:35,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:35,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794926320] [2025-04-13 17:28:35,715 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:28:35,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:35,745 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:28:35,767 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:28:35,767 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:28:35,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:28:37,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:37,811 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794926320] [2025-04-13 17:28:37,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794926320] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:37,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:37,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:28:37,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307119571] [2025-04-13 17:28:37,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:37,811 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:28:37,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:37,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:28:37,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:28:37,812 INFO L87 Difference]: Start difference. First operand 14204 states and 43743 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:28:42,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:42,151 INFO L93 Difference]: Finished difference Result 26824 states and 82812 transitions. [2025-04-13 17:28:42,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:28:42,151 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:28:42,151 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:42,550 INFO L225 Difference]: With dead ends: 26824 [2025-04-13 17:28:42,551 INFO L226 Difference]: Without dead ends: 15573 [2025-04-13 17:28:42,571 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:28:42,572 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 216 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4816 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 4816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:42,572 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 0 Invalid, 4866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 4816 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-04-13 17:28:42,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15573 states. [2025-04-13 17:28:42,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15573 to 14198. [2025-04-13 17:28:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14198 states, 14181 states have (on average 3.0834919963331218) internal successors, (43727), 14197 states have internal predecessors, (43727), 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-04-13 17:28:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14198 states to 14198 states and 43727 transitions. [2025-04-13 17:28:43,190 INFO L79 Accepts]: Start accepts. Automaton has 14198 states and 43727 transitions. Word has length 40 [2025-04-13 17:28:43,190 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:43,190 INFO L485 AbstractCegarLoop]: Abstraction has 14198 states and 43727 transitions. [2025-04-13 17:28:43,190 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:28:43,190 INFO L278 IsEmpty]: Start isEmpty. Operand 14198 states and 43727 transitions. [2025-04-13 17:28:43,194 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:28:43,194 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:43,194 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:43,194 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-13 17:28:43,194 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:28:43,195 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:43,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1600675691, now seen corresponding path program 30 times [2025-04-13 17:28:43,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:43,195 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698170003] [2025-04-13 17:28:43,195 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:28:43,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:43,224 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:28:43,240 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:28:43,240 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:28:43,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:28:44,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:44,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698170003] [2025-04-13 17:28:44,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698170003] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:44,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:44,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:28:44,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854072] [2025-04-13 17:28:44,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:44,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:28:44,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:44,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:28:44,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:28:44,902 INFO L87 Difference]: Start difference. First operand 14198 states and 43727 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:28:48,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:48,769 INFO L93 Difference]: Finished difference Result 26562 states and 82056 transitions. [2025-04-13 17:28:48,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:28:48,769 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:28:48,769 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:49,091 INFO L225 Difference]: With dead ends: 26562 [2025-04-13 17:28:49,091 INFO L226 Difference]: Without dead ends: 15315 [2025-04-13 17:28:49,116 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:28:49,116 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 213 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4326 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 4326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:49,116 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 0 Invalid, 4379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 4326 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-04-13 17:28:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15315 states. [2025-04-13 17:28:49,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15315 to 14200. [2025-04-13 17:28:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14200 states, 14183 states have (on average 3.084044278361419) internal successors, (43741), 14199 states have internal predecessors, (43741), 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-04-13 17:28:49,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14200 states to 14200 states and 43741 transitions. [2025-04-13 17:28:49,666 INFO L79 Accepts]: Start accepts. Automaton has 14200 states and 43741 transitions. Word has length 40 [2025-04-13 17:28:49,666 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:49,666 INFO L485 AbstractCegarLoop]: Abstraction has 14200 states and 43741 transitions. [2025-04-13 17:28:49,666 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:28:49,666 INFO L278 IsEmpty]: Start isEmpty. Operand 14200 states and 43741 transitions. [2025-04-13 17:28:49,670 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:28:49,670 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:49,670 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:49,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-13 17:28:49,670 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:28:49,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:49,671 INFO L85 PathProgramCache]: Analyzing trace with hash -593637749, now seen corresponding path program 31 times [2025-04-13 17:28:49,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:49,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248264877] [2025-04-13 17:28:49,671 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:28:49,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:49,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 17:28:49,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:28:49,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:28:49,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:28:52,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:52,176 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248264877] [2025-04-13 17:28:52,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248264877] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:52,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:52,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:28:52,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771532723] [2025-04-13 17:28:52,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:52,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:28:52,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:52,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:28:52,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:28:52,177 INFO L87 Difference]: Start difference. First operand 14200 states and 43741 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:28:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:28:56,241 INFO L93 Difference]: Finished difference Result 26614 states and 82223 transitions. [2025-04-13 17:28:56,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:28:56,242 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:28:56,242 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:28:56,565 INFO L225 Difference]: With dead ends: 26614 [2025-04-13 17:28:56,565 INFO L226 Difference]: Without dead ends: 15363 [2025-04-13 17:28:56,591 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:28:56,591 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 225 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4678 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 4678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:28:56,591 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 0 Invalid, 4728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 4678 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 17:28:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15363 states. [2025-04-13 17:28:56,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15363 to 14194. [2025-04-13 17:28:56,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14194 states, 14177 states have (on average 3.0842209212104112) internal successors, (43725), 14193 states have internal predecessors, (43725), 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-04-13 17:28:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14194 states to 14194 states and 43725 transitions. [2025-04-13 17:28:57,146 INFO L79 Accepts]: Start accepts. Automaton has 14194 states and 43725 transitions. Word has length 40 [2025-04-13 17:28:57,147 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:28:57,147 INFO L485 AbstractCegarLoop]: Abstraction has 14194 states and 43725 transitions. [2025-04-13 17:28:57,147 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:28:57,147 INFO L278 IsEmpty]: Start isEmpty. Operand 14194 states and 43725 transitions. [2025-04-13 17:28:57,150 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:28:57,150 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:28:57,151 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:28:57,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-13 17:28:57,151 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:28:57,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:28:57,151 INFO L85 PathProgramCache]: Analyzing trace with hash 257979861, now seen corresponding path program 32 times [2025-04-13 17:28:57,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:28:57,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891911171] [2025-04-13 17:28:57,151 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:28:57,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:28:57,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:28:57,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:28:57,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:28:57,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:28:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:28:59,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:28:59,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891911171] [2025-04-13 17:28:59,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891911171] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:28:59,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:28:59,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:28:59,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163012618] [2025-04-13 17:28:59,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:28:59,010 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:28:59,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:28:59,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:28:59,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:28:59,010 INFO L87 Difference]: Start difference. First operand 14194 states and 43725 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:29:02,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:02,900 INFO L93 Difference]: Finished difference Result 26784 states and 82696 transitions. [2025-04-13 17:29:02,900 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:29:02,900 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:29:02,900 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:03,237 INFO L225 Difference]: With dead ends: 26784 [2025-04-13 17:29:03,237 INFO L226 Difference]: Without dead ends: 15537 [2025-04-13 17:29:03,261 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:29:03,261 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4275 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 4275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:03,261 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 4331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 4275 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-04-13 17:29:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15537 states. [2025-04-13 17:29:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15537 to 14206. [2025-04-13 17:29:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14206 states, 14189 states have (on average 3.085559236027909) internal successors, (43781), 14205 states have internal predecessors, (43781), 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-04-13 17:29:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14206 states to 14206 states and 43781 transitions. [2025-04-13 17:29:03,983 INFO L79 Accepts]: Start accepts. Automaton has 14206 states and 43781 transitions. Word has length 40 [2025-04-13 17:29:03,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:03,984 INFO L485 AbstractCegarLoop]: Abstraction has 14206 states and 43781 transitions. [2025-04-13 17:29:03,984 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:29:03,984 INFO L278 IsEmpty]: Start isEmpty. Operand 14206 states and 43781 transitions. [2025-04-13 17:29:03,988 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:29:03,988 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:03,988 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:03,988 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-04-13 17:29:03,988 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:29:03,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:03,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1400011085, now seen corresponding path program 33 times [2025-04-13 17:29:03,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:03,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476803067] [2025-04-13 17:29:03,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:29:03,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:04,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:29:04,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:29:04,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:29:04,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:29:05,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:05,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476803067] [2025-04-13 17:29:05,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476803067] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:05,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:05,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 17:29:05,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452919491] [2025-04-13 17:29:05,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:05,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 17:29:05,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:05,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 17:29:05,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:29:05,311 INFO L87 Difference]: Start difference. First operand 14206 states and 43781 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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-04-13 17:29:09,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:09,378 INFO L93 Difference]: Finished difference Result 27198 states and 83993 transitions. [2025-04-13 17:29:09,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:29:09,378 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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 40 [2025-04-13 17:29:09,378 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:09,659 INFO L225 Difference]: With dead ends: 27198 [2025-04-13 17:29:09,659 INFO L226 Difference]: Without dead ends: 15847 [2025-04-13 17:29:09,680 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:29:09,680 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 283 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4572 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 4572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:09,680 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 0 Invalid, 4618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 4572 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 17:29:09,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15847 states. [2025-04-13 17:29:09,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15847 to 14266. [2025-04-13 17:29:09,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14266 states, 14249 states have (on average 3.085479682784757) internal successors, (43965), 14265 states have internal predecessors, (43965), 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-04-13 17:29:09,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14266 states to 14266 states and 43965 transitions. [2025-04-13 17:29:10,157 INFO L79 Accepts]: Start accepts. Automaton has 14266 states and 43965 transitions. Word has length 40 [2025-04-13 17:29:10,158 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:10,158 INFO L485 AbstractCegarLoop]: Abstraction has 14266 states and 43965 transitions. [2025-04-13 17:29:10,158 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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-04-13 17:29:10,158 INFO L278 IsEmpty]: Start isEmpty. Operand 14266 states and 43965 transitions. [2025-04-13 17:29:10,161 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:29:10,162 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:10,162 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:10,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-04-13 17:29:10,162 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:29:10,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:10,162 INFO L85 PathProgramCache]: Analyzing trace with hash -951499533, now seen corresponding path program 34 times [2025-04-13 17:29:10,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:10,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105158226] [2025-04-13 17:29:10,162 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:29:10,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:10,192 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:29:10,225 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:29:10,226 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:29:10,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:29:12,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:12,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105158226] [2025-04-13 17:29:12,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105158226] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:12,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:12,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:29:12,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762277761] [2025-04-13 17:29:12,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:12,118 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:29:12,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:12,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:29:12,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:29:12,118 INFO L87 Difference]: Start difference. First operand 14266 states and 43965 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:29:16,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:16,013 INFO L93 Difference]: Finished difference Result 26634 states and 82317 transitions. [2025-04-13 17:29:16,013 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:29:16,013 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:29:16,013 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:16,351 INFO L225 Difference]: With dead ends: 26634 [2025-04-13 17:29:16,351 INFO L226 Difference]: Without dead ends: 15339 [2025-04-13 17:29:16,376 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:29:16,376 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 188 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4245 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:16,376 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 0 Invalid, 4281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4245 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-04-13 17:29:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15339 states. [2025-04-13 17:29:16,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15339 to 14286. [2025-04-13 17:29:16,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14286 states, 14269 states have (on average 3.0848692970775806) internal successors, (44018), 14285 states have internal predecessors, (44018), 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-04-13 17:29:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14286 states to 14286 states and 44018 transitions. [2025-04-13 17:29:16,937 INFO L79 Accepts]: Start accepts. Automaton has 14286 states and 44018 transitions. Word has length 40 [2025-04-13 17:29:16,938 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:16,938 INFO L485 AbstractCegarLoop]: Abstraction has 14286 states and 44018 transitions. [2025-04-13 17:29:16,938 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:29:16,938 INFO L278 IsEmpty]: Start isEmpty. Operand 14286 states and 44018 transitions. [2025-04-13 17:29:16,941 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:29:16,941 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:16,942 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:16,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-04-13 17:29:16,942 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:29:16,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:16,942 INFO L85 PathProgramCache]: Analyzing trace with hash 55538409, now seen corresponding path program 35 times [2025-04-13 17:29:16,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:16,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555144189] [2025-04-13 17:29:16,942 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:29:16,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:16,971 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:29:17,094 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:29:17,094 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:29:17,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:29:19,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:19,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555144189] [2025-04-13 17:29:19,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555144189] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:19,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:19,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:29:19,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862958329] [2025-04-13 17:29:19,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:19,321 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:29:19,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:19,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:29:19,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:29:19,321 INFO L87 Difference]: Start difference. First operand 14286 states and 44018 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:29:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:22,722 INFO L93 Difference]: Finished difference Result 26736 states and 82655 transitions. [2025-04-13 17:29:22,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:29:22,722 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:29:22,722 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:23,031 INFO L225 Difference]: With dead ends: 26736 [2025-04-13 17:29:23,031 INFO L226 Difference]: Without dead ends: 15429 [2025-04-13 17:29:23,047 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:29:23,048 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 239 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3573 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:23,048 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 0 Invalid, 3629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3573 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-04-13 17:29:23,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15429 states. [2025-04-13 17:29:23,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15429 to 14280. [2025-04-13 17:29:23,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14280 states, 14263 states have (on average 3.0850452219028255) internal successors, (44002), 14279 states have internal predecessors, (44002), 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-04-13 17:29:23,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14280 states to 14280 states and 44002 transitions. [2025-04-13 17:29:23,592 INFO L79 Accepts]: Start accepts. Automaton has 14280 states and 44002 transitions. Word has length 40 [2025-04-13 17:29:23,592 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:23,592 INFO L485 AbstractCegarLoop]: Abstraction has 14280 states and 44002 transitions. [2025-04-13 17:29:23,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:29:23,592 INFO L278 IsEmpty]: Start isEmpty. Operand 14280 states and 44002 transitions. [2025-04-13 17:29:23,596 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:29:23,597 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:23,597 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:23,597 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-04-13 17:29:23,597 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:29:23,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:23,597 INFO L85 PathProgramCache]: Analyzing trace with hash 907156019, now seen corresponding path program 36 times [2025-04-13 17:29:23,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:23,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566978467] [2025-04-13 17:29:23,597 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:29:23,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:23,638 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:29:23,654 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:29:23,655 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:29:23,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:29:25,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:25,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566978467] [2025-04-13 17:29:25,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566978467] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:25,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:25,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:29:25,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517195119] [2025-04-13 17:29:25,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:25,510 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:29:25,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:25,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:29:25,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:29:25,510 INFO L87 Difference]: Start difference. First operand 14280 states and 44002 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:29:29,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:29,059 INFO L93 Difference]: Finished difference Result 26824 states and 82907 transitions. [2025-04-13 17:29:29,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:29:29,060 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:29:29,060 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:29,418 INFO L225 Difference]: With dead ends: 26824 [2025-04-13 17:29:29,419 INFO L226 Difference]: Without dead ends: 15521 [2025-04-13 17:29:29,443 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:29:29,444 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 294 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3872 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 3872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:29,444 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 0 Invalid, 3926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 3872 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 17:29:29,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15521 states. [2025-04-13 17:29:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15521 to 14274. [2025-04-13 17:29:29,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14274 states, 14257 states have (on average 3.0852212948025532) internal successors, (43986), 14273 states have internal predecessors, (43986), 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-04-13 17:29:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14274 states to 14274 states and 43986 transitions. [2025-04-13 17:29:30,035 INFO L79 Accepts]: Start accepts. Automaton has 14274 states and 43986 transitions. Word has length 40 [2025-04-13 17:29:30,035 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:30,036 INFO L485 AbstractCegarLoop]: Abstraction has 14274 states and 43986 transitions. [2025-04-13 17:29:30,036 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:29:30,036 INFO L278 IsEmpty]: Start isEmpty. Operand 14274 states and 43986 transitions. [2025-04-13 17:29:30,039 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:29:30,039 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:30,039 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:30,039 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-04-13 17:29:30,040 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:29:30,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:30,040 INFO L85 PathProgramCache]: Analyzing trace with hash 77151751, now seen corresponding path program 37 times [2025-04-13 17:29:30,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:30,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429226840] [2025-04-13 17:29:30,040 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:29:30,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:30,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 17:29:30,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:29:30,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:29:30,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:29:31,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:31,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429226840] [2025-04-13 17:29:31,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429226840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:31,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:31,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:29:31,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130531035] [2025-04-13 17:29:31,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:31,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:29:31,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:31,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:29:31,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:29:31,958 INFO L87 Difference]: Start difference. First operand 14274 states and 43986 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:29:36,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:36,113 INFO L93 Difference]: Finished difference Result 26874 states and 83060 transitions. [2025-04-13 17:29:36,113 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:29:36,114 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:29:36,114 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:36,556 INFO L225 Difference]: With dead ends: 26874 [2025-04-13 17:29:36,556 INFO L226 Difference]: Without dead ends: 15575 [2025-04-13 17:29:36,585 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:29:36,586 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 311 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4505 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 4505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:36,586 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 0 Invalid, 4557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 4505 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 17:29:36,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15575 states. [2025-04-13 17:29:36,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15575 to 14268. [2025-04-13 17:29:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14268 states, 14251 states have (on average 3.085397515963792) internal successors, (43970), 14267 states have internal predecessors, (43970), 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-04-13 17:29:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14268 states to 14268 states and 43970 transitions. [2025-04-13 17:29:37,275 INFO L79 Accepts]: Start accepts. Automaton has 14268 states and 43970 transitions. Word has length 40 [2025-04-13 17:29:37,276 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:37,276 INFO L485 AbstractCegarLoop]: Abstraction has 14268 states and 43970 transitions. [2025-04-13 17:29:37,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:29:37,276 INFO L278 IsEmpty]: Start isEmpty. Operand 14268 states and 43970 transitions. [2025-04-13 17:29:37,280 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:29:37,280 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:37,280 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:37,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-04-13 17:29:37,280 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:29:37,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:37,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1279265749, now seen corresponding path program 38 times [2025-04-13 17:29:37,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:37,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657160586] [2025-04-13 17:29:37,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:29:37,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:37,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:29:37,325 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:29:37,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:29:37,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:29:39,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:39,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657160586] [2025-04-13 17:29:39,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657160586] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:39,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:39,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:29:39,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728006760] [2025-04-13 17:29:39,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:39,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:29:39,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:39,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:29:39,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:29:39,134 INFO L87 Difference]: Start difference. First operand 14268 states and 43970 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:29:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:42,598 INFO L93 Difference]: Finished difference Result 27440 states and 84841 transitions. [2025-04-13 17:29:42,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:29:42,598 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:29:42,598 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:42,980 INFO L225 Difference]: With dead ends: 27440 [2025-04-13 17:29:42,980 INFO L226 Difference]: Without dead ends: 16145 [2025-04-13 17:29:43,004 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:29:43,004 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 363 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4085 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 4085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:43,005 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 0 Invalid, 4138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 4085 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 17:29:43,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16145 states. [2025-04-13 17:29:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16145 to 14258. [2025-04-13 17:29:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14258 states, 14241 states have (on average 3.0851063829787235) internal successors, (43935), 14257 states have internal predecessors, (43935), 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-04-13 17:29:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14258 states to 14258 states and 43935 transitions. [2025-04-13 17:29:43,616 INFO L79 Accepts]: Start accepts. Automaton has 14258 states and 43935 transitions. Word has length 40 [2025-04-13 17:29:43,616 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:43,616 INFO L485 AbstractCegarLoop]: Abstraction has 14258 states and 43935 transitions. [2025-04-13 17:29:43,616 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:29:43,617 INFO L278 IsEmpty]: Start isEmpty. Operand 14258 states and 43935 transitions. [2025-04-13 17:29:43,621 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:29:43,621 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:43,621 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:43,621 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-04-13 17:29:43,621 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:29:43,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:43,621 INFO L85 PathProgramCache]: Analyzing trace with hash -330825579, now seen corresponding path program 39 times [2025-04-13 17:29:43,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:43,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103471615] [2025-04-13 17:29:43,622 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:29:43,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:43,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:29:43,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:29:43,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:29:43,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:29:45,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:45,419 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103471615] [2025-04-13 17:29:45,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103471615] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:45,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:45,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:29:45,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071154317] [2025-04-13 17:29:45,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:45,419 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:29:45,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:45,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:29:45,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:29:45,420 INFO L87 Difference]: Start difference. First operand 14258 states and 43935 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:29:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:48,949 INFO L93 Difference]: Finished difference Result 26532 states and 82027 transitions. [2025-04-13 17:29:48,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:29:48,950 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:29:48,950 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:49,313 INFO L225 Difference]: With dead ends: 26532 [2025-04-13 17:29:49,313 INFO L226 Difference]: Without dead ends: 15245 [2025-04-13 17:29:49,337 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:29:49,338 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3971 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:49,338 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 4001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3971 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 17:29:49,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15245 states. [2025-04-13 17:29:49,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15245 to 14256. [2025-04-13 17:29:49,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14256 states, 14239 states have (on average 3.085750403820493) internal successors, (43938), 14255 states have internal predecessors, (43938), 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-04-13 17:29:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14256 states to 14256 states and 43938 transitions. [2025-04-13 17:29:50,062 INFO L79 Accepts]: Start accepts. Automaton has 14256 states and 43938 transitions. Word has length 40 [2025-04-13 17:29:50,062 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:50,062 INFO L485 AbstractCegarLoop]: Abstraction has 14256 states and 43938 transitions. [2025-04-13 17:29:50,062 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:29:50,063 INFO L278 IsEmpty]: Start isEmpty. Operand 14256 states and 43938 transitions. [2025-04-13 17:29:50,066 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:29:50,066 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:50,066 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:50,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-04-13 17:29:50,067 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:29:50,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:50,067 INFO L85 PathProgramCache]: Analyzing trace with hash 676212363, now seen corresponding path program 40 times [2025-04-13 17:29:50,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:50,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28804204] [2025-04-13 17:29:50,067 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:29:50,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:50,101 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:29:50,119 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:29:50,119 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:29:50,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:29:51,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:51,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28804204] [2025-04-13 17:29:51,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28804204] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:51,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:51,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:29:51,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405000390] [2025-04-13 17:29:51,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:51,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:29:51,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:51,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:29:51,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:29:51,958 INFO L87 Difference]: Start difference. First operand 14256 states and 43938 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:29:55,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:29:55,390 INFO L93 Difference]: Finished difference Result 26604 states and 82259 transitions. [2025-04-13 17:29:55,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:29:55,391 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:29:55,391 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:29:55,775 INFO L225 Difference]: With dead ends: 26604 [2025-04-13 17:29:55,775 INFO L226 Difference]: Without dead ends: 15317 [2025-04-13 17:29:55,800 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:29:55,800 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4093 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:29:55,800 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 0 Invalid, 4124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4093 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 17:29:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15317 states. [2025-04-13 17:29:55,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15317 to 14250. [2025-04-13 17:29:56,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14250 states, 14233 states have (on average 3.08592707089159) internal successors, (43922), 14249 states have internal predecessors, (43922), 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-04-13 17:29:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14250 states to 14250 states and 43922 transitions. [2025-04-13 17:29:56,443 INFO L79 Accepts]: Start accepts. Automaton has 14250 states and 43922 transitions. Word has length 40 [2025-04-13 17:29:56,443 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:29:56,443 INFO L485 AbstractCegarLoop]: Abstraction has 14250 states and 43922 transitions. [2025-04-13 17:29:56,443 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:29:56,443 INFO L278 IsEmpty]: Start isEmpty. Operand 14250 states and 43922 transitions. [2025-04-13 17:29:56,447 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:29:56,447 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:29:56,447 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:29:56,448 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-04-13 17:29:56,448 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:29:56,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:29:56,448 INFO L85 PathProgramCache]: Analyzing trace with hash -368164075, now seen corresponding path program 41 times [2025-04-13 17:29:56,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:29:56,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409068385] [2025-04-13 17:29:56,448 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:29:56,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:29:56,484 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:29:56,500 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:29:56,500 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:29:56,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:29:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:29:58,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:29:58,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409068385] [2025-04-13 17:29:58,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409068385] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:29:58,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:29:58,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:29:58,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304038791] [2025-04-13 17:29:58,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:29:58,458 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:29:58,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:29:58,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:29:58,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:29:58,458 INFO L87 Difference]: Start difference. First operand 14250 states and 43922 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:30:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:01,375 INFO L93 Difference]: Finished difference Result 26598 states and 82241 transitions. [2025-04-13 17:30:01,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:30:01,376 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:30:01,376 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:01,731 INFO L225 Difference]: With dead ends: 26598 [2025-04-13 17:30:01,732 INFO L226 Difference]: Without dead ends: 15315 [2025-04-13 17:30:01,757 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:30:01,757 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 202 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3493 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:01,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 0 Invalid, 3530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3493 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-04-13 17:30:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15315 states. [2025-04-13 17:30:01,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15315 to 14244. [2025-04-13 17:30:01,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14244 states, 14227 states have (on average 3.086103886975469) internal successors, (43906), 14243 states have internal predecessors, (43906), 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-04-13 17:30:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14244 states to 14244 states and 43906 transitions. [2025-04-13 17:30:02,373 INFO L79 Accepts]: Start accepts. Automaton has 14244 states and 43906 transitions. Word has length 40 [2025-04-13 17:30:02,374 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:02,374 INFO L485 AbstractCegarLoop]: Abstraction has 14244 states and 43906 transitions. [2025-04-13 17:30:02,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:30:02,374 INFO L278 IsEmpty]: Start isEmpty. Operand 14244 states and 43906 transitions. [2025-04-13 17:30:02,378 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:30:02,378 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:02,378 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:02,378 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-04-13 17:30:02,379 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:30:02,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:02,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1701147543, now seen corresponding path program 42 times [2025-04-13 17:30:02,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:02,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014530487] [2025-04-13 17:30:02,379 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:30:02,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:02,410 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:30:02,423 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:30:02,423 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:30:02,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:30:04,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:04,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014530487] [2025-04-13 17:30:04,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014530487] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:04,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:04,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:30:04,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378921607] [2025-04-13 17:30:04,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:04,183 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:30:04,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:04,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:30:04,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:30:04,183 INFO L87 Difference]: Start difference. First operand 14244 states and 43906 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:30:08,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:08,328 INFO L93 Difference]: Finished difference Result 26708 states and 82578 transitions. [2025-04-13 17:30:08,328 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:30:08,328 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:30:08,328 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:08,725 INFO L225 Difference]: With dead ends: 26708 [2025-04-13 17:30:08,725 INFO L226 Difference]: Without dead ends: 15429 [2025-04-13 17:30:08,751 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:30:08,752 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 203 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4741 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 4741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:08,752 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 0 Invalid, 4782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 4741 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 17:30:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15429 states. [2025-04-13 17:30:09,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15429 to 14238. [2025-04-13 17:30:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14238 states, 14221 states have (on average 3.086280852260741) internal successors, (43890), 14237 states have internal predecessors, (43890), 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-04-13 17:30:09,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14238 states to 14238 states and 43890 transitions. [2025-04-13 17:30:09,445 INFO L79 Accepts]: Start accepts. Automaton has 14238 states and 43890 transitions. Word has length 40 [2025-04-13 17:30:09,445 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:09,445 INFO L485 AbstractCegarLoop]: Abstraction has 14238 states and 43890 transitions. [2025-04-13 17:30:09,445 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:30:09,445 INFO L278 IsEmpty]: Start isEmpty. Operand 14238 states and 43890 transitions. [2025-04-13 17:30:09,450 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:30:09,450 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:09,450 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:09,450 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2025-04-13 17:30:09,450 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:30:09,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:09,451 INFO L85 PathProgramCache]: Analyzing trace with hash 3945655, now seen corresponding path program 43 times [2025-04-13 17:30:09,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:09,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920459775] [2025-04-13 17:30:09,451 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:30:09,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:09,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 17:30:09,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:30:09,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:09,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:30:11,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:11,673 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920459775] [2025-04-13 17:30:11,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920459775] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:11,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:11,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:30:11,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525266153] [2025-04-13 17:30:11,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:11,674 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:30:11,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:11,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:30:11,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:30:11,674 INFO L87 Difference]: Start difference. First operand 14238 states and 43890 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:30:15,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:15,942 INFO L93 Difference]: Finished difference Result 28808 states and 89264 transitions. [2025-04-13 17:30:15,942 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:30:15,942 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:30:15,942 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:16,410 INFO L225 Difference]: With dead ends: 28808 [2025-04-13 17:30:16,410 INFO L226 Difference]: Without dead ends: 16353 [2025-04-13 17:30:16,453 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:30:16,453 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 371 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4784 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:16,454 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 0 Invalid, 4839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 4784 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 17:30:16,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16353 states. [2025-04-13 17:30:16,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16353 to 14358. [2025-04-13 17:30:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14358 states, 14341 states have (on average 3.086883759849383) internal successors, (44269), 14357 states have internal predecessors, (44269), 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-04-13 17:30:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14358 states to 14358 states and 44269 transitions. [2025-04-13 17:30:17,119 INFO L79 Accepts]: Start accepts. Automaton has 14358 states and 44269 transitions. Word has length 40 [2025-04-13 17:30:17,119 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:17,119 INFO L485 AbstractCegarLoop]: Abstraction has 14358 states and 44269 transitions. [2025-04-13 17:30:17,119 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:30:17,119 INFO L278 IsEmpty]: Start isEmpty. Operand 14358 states and 44269 transitions. [2025-04-13 17:30:17,123 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:30:17,123 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:17,123 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:17,123 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-04-13 17:30:17,123 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:30:17,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:17,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1676393971, now seen corresponding path program 1 times [2025-04-13 17:30:17,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:17,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319632603] [2025-04-13 17:30:17,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:30:17,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:17,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 17:30:17,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:30:17,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:17,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:30:18,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:18,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319632603] [2025-04-13 17:30:18,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319632603] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:18,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:18,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 17:30:18,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831053627] [2025-04-13 17:30:18,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:18,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:30:18,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:18,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:30:18,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:30:18,444 INFO L87 Difference]: Start difference. First operand 14358 states and 44269 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-04-13 17:30:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:21,159 INFO L93 Difference]: Finished difference Result 31085 states and 98613 transitions. [2025-04-13 17:30:21,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:30:21,159 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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 40 [2025-04-13 17:30:21,159 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:21,578 INFO L225 Difference]: With dead ends: 31085 [2025-04-13 17:30:21,578 INFO L226 Difference]: Without dead ends: 19476 [2025-04-13 17:30:21,619 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:30:21,620 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 364 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3376 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 3376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:21,620 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 0 Invalid, 3405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 3376 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-04-13 17:30:21,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19476 states. [2025-04-13 17:30:22,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19476 to 15915. [2025-04-13 17:30:22,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15915 states, 15898 states have (on average 3.0797584601836707) internal successors, (48962), 15914 states have internal predecessors, (48962), 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-04-13 17:30:22,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15915 states to 15915 states and 48962 transitions. [2025-04-13 17:30:22,484 INFO L79 Accepts]: Start accepts. Automaton has 15915 states and 48962 transitions. Word has length 40 [2025-04-13 17:30:22,484 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:22,484 INFO L485 AbstractCegarLoop]: Abstraction has 15915 states and 48962 transitions. [2025-04-13 17:30:22,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 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-04-13 17:30:22,484 INFO L278 IsEmpty]: Start isEmpty. Operand 15915 states and 48962 transitions. [2025-04-13 17:30:22,488 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:30:22,488 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:22,488 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:22,488 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-04-13 17:30:22,488 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:30:22,489 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:22,489 INFO L85 PathProgramCache]: Analyzing trace with hash 30675455, now seen corresponding path program 2 times [2025-04-13 17:30:22,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:22,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139098613] [2025-04-13 17:30:22,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:30:22,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:22,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:30:22,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:30:22,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:30:22,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:30:23,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:23,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139098613] [2025-04-13 17:30:23,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139098613] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:23,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:23,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 17:30:23,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678416618] [2025-04-13 17:30:23,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:23,557 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 17:30:23,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:23,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 17:30:23,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:30:23,558 INFO L87 Difference]: Start difference. First operand 15915 states and 48962 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 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-04-13 17:30:27,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:27,992 INFO L93 Difference]: Finished difference Result 33632 states and 106299 transitions. [2025-04-13 17:30:27,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 17:30:27,993 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 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 40 [2025-04-13 17:30:27,993 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:28,459 INFO L225 Difference]: With dead ends: 33632 [2025-04-13 17:30:28,459 INFO L226 Difference]: Without dead ends: 20975 [2025-04-13 17:30:28,495 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:30:28,495 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 395 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5207 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 5207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:28,495 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 0 Invalid, 5242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 5207 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-04-13 17:30:28,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20975 states. [2025-04-13 17:30:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20975 to 15958. [2025-04-13 17:30:28,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15958 states, 15941 states have (on average 3.077535913681701) internal successors, (49059), 15957 states have internal predecessors, (49059), 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-04-13 17:30:28,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15958 states to 15958 states and 49059 transitions. [2025-04-13 17:30:29,291 INFO L79 Accepts]: Start accepts. Automaton has 15958 states and 49059 transitions. Word has length 40 [2025-04-13 17:30:29,291 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:29,291 INFO L485 AbstractCegarLoop]: Abstraction has 15958 states and 49059 transitions. [2025-04-13 17:30:29,291 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 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-04-13 17:30:29,291 INFO L278 IsEmpty]: Start isEmpty. Operand 15958 states and 49059 transitions. [2025-04-13 17:30:29,295 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:30:29,295 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:29,296 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:29,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2025-04-13 17:30:29,296 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:30:29,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:29,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1607456075, now seen corresponding path program 1 times [2025-04-13 17:30:29,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:29,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128010835] [2025-04-13 17:30:29,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:30:29,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:29,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 17:30:29,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:30:29,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:30:29,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:30:31,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:31,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128010835] [2025-04-13 17:30:31,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128010835] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:31,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:31,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:30:31,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692912599] [2025-04-13 17:30:31,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:31,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:30:31,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:31,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:30:31,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:30:31,269 INFO L87 Difference]: Start difference. First operand 15958 states and 49059 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:30:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:35,570 INFO L93 Difference]: Finished difference Result 29269 states and 89940 transitions. [2025-04-13 17:30:35,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:30:35,570 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:30:35,570 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:36,022 INFO L225 Difference]: With dead ends: 29269 [2025-04-13 17:30:36,022 INFO L226 Difference]: Without dead ends: 16674 [2025-04-13 17:30:36,051 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:30:36,051 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 212 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4717 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:36,051 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 0 Invalid, 4757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 4717 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-04-13 17:30:36,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16674 states. [2025-04-13 17:30:36,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16674 to 16308. [2025-04-13 17:30:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16308 states, 16291 states have (on average 3.0734761524768275) internal successors, (50070), 16307 states have internal predecessors, (50070), 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-04-13 17:30:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16308 states to 16308 states and 50070 transitions. [2025-04-13 17:30:36,755 INFO L79 Accepts]: Start accepts. Automaton has 16308 states and 50070 transitions. Word has length 40 [2025-04-13 17:30:36,755 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:36,755 INFO L485 AbstractCegarLoop]: Abstraction has 16308 states and 50070 transitions. [2025-04-13 17:30:36,755 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:30:36,755 INFO L278 IsEmpty]: Start isEmpty. Operand 16308 states and 50070 transitions. [2025-04-13 17:30:36,759 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:30:36,760 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:36,760 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:36,760 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2025-04-13 17:30:36,760 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:30:36,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:36,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1041792705, now seen corresponding path program 2 times [2025-04-13 17:30:36,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:36,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294663978] [2025-04-13 17:30:36,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:30:36,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:36,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:30:36,812 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:30:36,812 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:30:36,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:30:38,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:38,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294663978] [2025-04-13 17:30:38,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294663978] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:38,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:38,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:30:38,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500544209] [2025-04-13 17:30:38,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:38,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:30:38,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:38,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:30:38,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:30:38,588 INFO L87 Difference]: Start difference. First operand 16308 states and 50070 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:30:42,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:42,257 INFO L93 Difference]: Finished difference Result 30025 states and 92089 transitions. [2025-04-13 17:30:42,258 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:30:42,258 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:30:42,258 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:42,727 INFO L225 Difference]: With dead ends: 30025 [2025-04-13 17:30:42,727 INFO L226 Difference]: Without dead ends: 17168 [2025-04-13 17:30:42,754 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:30:42,754 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 180 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4308 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:42,755 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 0 Invalid, 4338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4308 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-04-13 17:30:42,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17168 states. [2025-04-13 17:30:42,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17168 to 16332. [2025-04-13 17:30:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16332 states, 16315 states have (on average 3.072877719889672) internal successors, (50134), 16331 states have internal predecessors, (50134), 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-04-13 17:30:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16332 states to 16332 states and 50134 transitions. [2025-04-13 17:30:43,447 INFO L79 Accepts]: Start accepts. Automaton has 16332 states and 50134 transitions. Word has length 40 [2025-04-13 17:30:43,447 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:43,447 INFO L485 AbstractCegarLoop]: Abstraction has 16332 states and 50134 transitions. [2025-04-13 17:30:43,447 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:30:43,447 INFO L278 IsEmpty]: Start isEmpty. Operand 16332 states and 50134 transitions. [2025-04-13 17:30:43,452 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:30:43,452 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:43,452 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:43,452 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2025-04-13 17:30:43,452 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:30:43,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:43,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1645874113, now seen corresponding path program 3 times [2025-04-13 17:30:43,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:43,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460498195] [2025-04-13 17:30:43,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:30:43,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:43,483 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:30:43,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:30:43,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:30:43,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:45,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:30:45,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:45,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460498195] [2025-04-13 17:30:45,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460498195] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:45,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:45,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:30:45,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776487235] [2025-04-13 17:30:45,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:45,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:30:45,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:45,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:30:45,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:30:45,294 INFO L87 Difference]: Start difference. First operand 16332 states and 50134 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:30:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:48,865 INFO L93 Difference]: Finished difference Result 30619 states and 93786 transitions. [2025-04-13 17:30:48,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 17:30:48,866 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:30:48,866 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:49,443 INFO L225 Difference]: With dead ends: 30619 [2025-04-13 17:30:49,443 INFO L226 Difference]: Without dead ends: 17458 [2025-04-13 17:30:49,467 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:30:49,467 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 272 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3883 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:49,468 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 0 Invalid, 3920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3883 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 17:30:49,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17458 states. [2025-04-13 17:30:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17458 to 16580. [2025-04-13 17:30:49,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16580 states, 16563 states have (on average 3.065567831914508) internal successors, (50775), 16579 states have internal predecessors, (50775), 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-04-13 17:30:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16580 states to 16580 states and 50775 transitions. [2025-04-13 17:30:50,249 INFO L79 Accepts]: Start accepts. Automaton has 16580 states and 50775 transitions. Word has length 40 [2025-04-13 17:30:50,250 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:50,250 INFO L485 AbstractCegarLoop]: Abstraction has 16580 states and 50775 transitions. [2025-04-13 17:30:50,250 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:30:50,250 INFO L278 IsEmpty]: Start isEmpty. Operand 16580 states and 50775 transitions. [2025-04-13 17:30:50,255 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:30:50,255 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:50,255 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:50,255 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2025-04-13 17:30:50,255 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:30:50,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:50,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1105307721, now seen corresponding path program 4 times [2025-04-13 17:30:50,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:50,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566938081] [2025-04-13 17:30:50,256 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:30:50,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:50,287 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:30:50,320 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:30:50,321 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:30:50,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:52,184 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:30:52,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:52,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566938081] [2025-04-13 17:30:52,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566938081] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:52,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:52,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:30:52,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191339487] [2025-04-13 17:30:52,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:52,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:30:52,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:52,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:30:52,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:30:52,185 INFO L87 Difference]: Start difference. First operand 16580 states and 50775 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:30:56,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:30:56,586 INFO L93 Difference]: Finished difference Result 30559 states and 93527 transitions. [2025-04-13 17:30:56,586 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:30:56,586 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:30:56,586 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:30:57,058 INFO L225 Difference]: With dead ends: 30559 [2025-04-13 17:30:57,058 INFO L226 Difference]: Without dead ends: 17570 [2025-04-13 17:30:57,086 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:30:57,087 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 209 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4819 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:30:57,087 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 0 Invalid, 4855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4819 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-04-13 17:30:57,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17570 states. [2025-04-13 17:30:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17570 to 16574. [2025-04-13 17:30:57,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16574 states, 16557 states have (on average 3.0657123875098145) internal successors, (50759), 16573 states have internal predecessors, (50759), 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-04-13 17:30:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16574 states to 16574 states and 50759 transitions. [2025-04-13 17:30:57,836 INFO L79 Accepts]: Start accepts. Automaton has 16574 states and 50759 transitions. Word has length 40 [2025-04-13 17:30:57,836 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:30:57,837 INFO L485 AbstractCegarLoop]: Abstraction has 16574 states and 50759 transitions. [2025-04-13 17:30:57,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:30:57,837 INFO L278 IsEmpty]: Start isEmpty. Operand 16574 states and 50759 transitions. [2025-04-13 17:30:57,841 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:30:57,841 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:30:57,841 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:30:57,841 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-04-13 17:30:57,841 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:30:57,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:30:57,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2046382133, now seen corresponding path program 5 times [2025-04-13 17:30:57,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:30:57,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145286942] [2025-04-13 17:30:57,842 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:30:57,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:30:57,872 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:30:57,889 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:30:57,890 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:30:57,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:30:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:30:59,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:30:59,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145286942] [2025-04-13 17:30:59,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145286942] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:30:59,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:30:59,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:30:59,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570665405] [2025-04-13 17:30:59,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:30:59,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:30:59,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:30:59,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:30:59,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:30:59,719 INFO L87 Difference]: Start difference. First operand 16574 states and 50759 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:31:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:04,333 INFO L93 Difference]: Finished difference Result 30509 states and 93358 transitions. [2025-04-13 17:31:04,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 17:31:04,333 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:31:04,333 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:04,782 INFO L225 Difference]: With dead ends: 30509 [2025-04-13 17:31:04,782 INFO L226 Difference]: Without dead ends: 17524 [2025-04-13 17:31:04,803 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:31:04,804 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 254 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5243 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 5243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:04,804 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 0 Invalid, 5276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 5243 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-04-13 17:31:04,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17524 states. [2025-04-13 17:31:05,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17524 to 16598. [2025-04-13 17:31:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16598 states, 16581 states have (on average 3.0658585127555638) internal successors, (50835), 16597 states have internal predecessors, (50835), 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-04-13 17:31:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16598 states to 16598 states and 50835 transitions. [2025-04-13 17:31:05,520 INFO L79 Accepts]: Start accepts. Automaton has 16598 states and 50835 transitions. Word has length 40 [2025-04-13 17:31:05,520 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:05,520 INFO L485 AbstractCegarLoop]: Abstraction has 16598 states and 50835 transitions. [2025-04-13 17:31:05,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:31:05,520 INFO L278 IsEmpty]: Start isEmpty. Operand 16598 states and 50835 transitions. [2025-04-13 17:31:05,524 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:31:05,525 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:05,525 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:05,525 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2025-04-13 17:31:05,525 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:31:05,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:05,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1143725759, now seen corresponding path program 6 times [2025-04-13 17:31:05,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:05,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475879003] [2025-04-13 17:31:05,525 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:31:05,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:05,558 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:31:05,572 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:31:05,572 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:31:05,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:07,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:31:07,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:07,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475879003] [2025-04-13 17:31:07,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475879003] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:07,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:07,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:31:07,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268796147] [2025-04-13 17:31:07,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:07,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:31:07,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:07,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:31:07,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:31:07,210 INFO L87 Difference]: Start difference. First operand 16598 states and 50835 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:31:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:10,776 INFO L93 Difference]: Finished difference Result 30731 states and 94174 transitions. [2025-04-13 17:31:10,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:31:10,777 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:31:10,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:11,256 INFO L225 Difference]: With dead ends: 30731 [2025-04-13 17:31:11,257 INFO L226 Difference]: Without dead ends: 17730 [2025-04-13 17:31:11,287 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:31:11,287 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 254 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4239 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 4239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:11,287 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 0 Invalid, 4286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 4239 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 17:31:11,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17730 states. [2025-04-13 17:31:11,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17730 to 16598. [2025-04-13 17:31:11,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16598 states, 16581 states have (on average 3.0669440926361498) internal successors, (50853), 16597 states have internal predecessors, (50853), 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-04-13 17:31:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16598 states to 16598 states and 50853 transitions. [2025-04-13 17:31:12,256 INFO L79 Accepts]: Start accepts. Automaton has 16598 states and 50853 transitions. Word has length 40 [2025-04-13 17:31:12,256 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:12,256 INFO L485 AbstractCegarLoop]: Abstraction has 16598 states and 50853 transitions. [2025-04-13 17:31:12,256 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:31:12,256 INFO L278 IsEmpty]: Start isEmpty. Operand 16598 states and 50853 transitions. [2025-04-13 17:31:12,261 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:31:12,261 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:12,261 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:12,261 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2025-04-13 17:31:12,261 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:31:12,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1598031551, now seen corresponding path program 7 times [2025-04-13 17:31:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:12,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115803686] [2025-04-13 17:31:12,262 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:31:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:12,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 17:31:12,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:31:12,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:31:12,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:31:14,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:14,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115803686] [2025-04-13 17:31:14,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115803686] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:14,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:14,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:31:14,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290015152] [2025-04-13 17:31:14,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:14,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:31:14,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:14,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:31:14,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:31:14,398 INFO L87 Difference]: Start difference. First operand 16598 states and 50853 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:31:17,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:17,797 INFO L93 Difference]: Finished difference Result 31153 states and 95389 transitions. [2025-04-13 17:31:17,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:31:17,797 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:31:17,797 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:18,266 INFO L225 Difference]: With dead ends: 31153 [2025-04-13 17:31:18,266 INFO L226 Difference]: Without dead ends: 18152 [2025-04-13 17:31:18,292 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:31:18,293 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 314 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4031 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 4031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:18,293 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 0 Invalid, 4070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 4031 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 17:31:18,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18152 states. [2025-04-13 17:31:18,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18152 to 16620. [2025-04-13 17:31:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16620 states, 16603 states have (on average 3.0666746973438537) internal successors, (50916), 16619 states have internal predecessors, (50916), 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-04-13 17:31:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16620 states to 16620 states and 50916 transitions. [2025-04-13 17:31:19,123 INFO L79 Accepts]: Start accepts. Automaton has 16620 states and 50916 transitions. Word has length 40 [2025-04-13 17:31:19,123 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:19,123 INFO L485 AbstractCegarLoop]: Abstraction has 16620 states and 50916 transitions. [2025-04-13 17:31:19,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:31:19,123 INFO L278 IsEmpty]: Start isEmpty. Operand 16620 states and 50916 transitions. [2025-04-13 17:31:19,127 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:31:19,127 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:19,128 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:19,128 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2025-04-13 17:31:19,128 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:31:19,128 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1746436809, now seen corresponding path program 8 times [2025-04-13 17:31:19,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:19,128 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875704454] [2025-04-13 17:31:19,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:31:19,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:19,159 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:31:19,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:31:19,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:31:19,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:31:20,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:20,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875704454] [2025-04-13 17:31:20,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875704454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:20,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:20,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:31:20,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157564928] [2025-04-13 17:31:20,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:20,847 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:31:20,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:20,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:31:20,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:31:20,847 INFO L87 Difference]: Start difference. First operand 16620 states and 50916 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:31:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:24,216 INFO L93 Difference]: Finished difference Result 30973 states and 94768 transitions. [2025-04-13 17:31:24,217 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:31:24,217 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:31:24,217 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:24,853 INFO L225 Difference]: With dead ends: 30973 [2025-04-13 17:31:24,853 INFO L226 Difference]: Without dead ends: 17764 [2025-04-13 17:31:24,874 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:31:24,874 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 282 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4038 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 4038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:24,874 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 0 Invalid, 4079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 4038 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-04-13 17:31:24,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17764 states. [2025-04-13 17:31:25,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17764 to 16578. [2025-04-13 17:31:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16578 states, 16561 states have (on average 3.0663607270092386) internal successors, (50782), 16577 states have internal predecessors, (50782), 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-04-13 17:31:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16578 states to 16578 states and 50782 transitions. [2025-04-13 17:31:25,671 INFO L79 Accepts]: Start accepts. Automaton has 16578 states and 50782 transitions. Word has length 40 [2025-04-13 17:31:25,671 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:25,671 INFO L485 AbstractCegarLoop]: Abstraction has 16578 states and 50782 transitions. [2025-04-13 17:31:25,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:31:25,672 INFO L278 IsEmpty]: Start isEmpty. Operand 16578 states and 50782 transitions. [2025-04-13 17:31:25,677 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:31:25,677 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:25,677 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:25,678 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2025-04-13 17:31:25,678 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:31:25,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:25,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1951349165, now seen corresponding path program 9 times [2025-04-13 17:31:25,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:25,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136155521] [2025-04-13 17:31:25,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:31:25,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:25,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:31:25,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:31:25,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:31:25,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:31:27,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:27,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136155521] [2025-04-13 17:31:27,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136155521] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:27,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:27,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:31:27,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062021569] [2025-04-13 17:31:27,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:27,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:31:27,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:27,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:31:27,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:31:27,606 INFO L87 Difference]: Start difference. First operand 16578 states and 50782 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:31:31,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:31,088 INFO L93 Difference]: Finished difference Result 30653 states and 93802 transitions. [2025-04-13 17:31:31,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:31:31,088 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:31:31,088 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:31,688 INFO L225 Difference]: With dead ends: 30653 [2025-04-13 17:31:31,688 INFO L226 Difference]: Without dead ends: 17680 [2025-04-13 17:31:31,713 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:31:31,713 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 249 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3945 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 3945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:31,713 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 0 Invalid, 3996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 3945 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 17:31:31,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17680 states. [2025-04-13 17:31:31,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17680 to 16584. [2025-04-13 17:31:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16584 states, 16567 states have (on average 3.0662159715096275) internal successors, (50798), 16583 states have internal predecessors, (50798), 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-04-13 17:31:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16584 states to 16584 states and 50798 transitions. [2025-04-13 17:31:32,435 INFO L79 Accepts]: Start accepts. Automaton has 16584 states and 50798 transitions. Word has length 40 [2025-04-13 17:31:32,435 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:32,435 INFO L485 AbstractCegarLoop]: Abstraction has 16584 states and 50798 transitions. [2025-04-13 17:31:32,435 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:31:32,435 INFO L278 IsEmpty]: Start isEmpty. Operand 16584 states and 50798 transitions. [2025-04-13 17:31:32,440 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:31:32,440 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:32,440 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:32,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2025-04-13 17:31:32,440 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:31:32,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:32,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2100179905, now seen corresponding path program 10 times [2025-04-13 17:31:32,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:32,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628281915] [2025-04-13 17:31:32,440 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:31:32,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:32,473 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:31:32,500 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:31:32,500 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:31:32,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:34,324 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:31:34,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:34,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628281915] [2025-04-13 17:31:34,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628281915] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:34,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:34,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:31:34,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193468661] [2025-04-13 17:31:34,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:34,325 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:31:34,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:34,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:31:34,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:31:34,325 INFO L87 Difference]: Start difference. First operand 16584 states and 50798 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:31:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:37,860 INFO L93 Difference]: Finished difference Result 31215 states and 95580 transitions. [2025-04-13 17:31:37,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:31:37,861 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:31:37,861 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:38,345 INFO L225 Difference]: With dead ends: 31215 [2025-04-13 17:31:38,345 INFO L226 Difference]: Without dead ends: 18238 [2025-04-13 17:31:38,374 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:31:38,375 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 340 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4027 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 4027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:38,375 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 0 Invalid, 4069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 4027 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 17:31:38,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18238 states. [2025-04-13 17:31:38,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18238 to 16578. [2025-04-13 17:31:38,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16578 states, 16561 states have (on average 3.0663607270092386) internal successors, (50782), 16577 states have internal predecessors, (50782), 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-04-13 17:31:38,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16578 states to 16578 states and 50782 transitions. [2025-04-13 17:31:39,304 INFO L79 Accepts]: Start accepts. Automaton has 16578 states and 50782 transitions. Word has length 40 [2025-04-13 17:31:39,304 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:39,304 INFO L485 AbstractCegarLoop]: Abstraction has 16578 states and 50782 transitions. [2025-04-13 17:31:39,305 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:31:39,305 INFO L278 IsEmpty]: Start isEmpty. Operand 16578 states and 50782 transitions. [2025-04-13 17:31:39,309 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:31:39,310 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:39,310 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:39,310 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-04-13 17:31:39,310 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:31:39,310 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:39,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1896456681, now seen corresponding path program 11 times [2025-04-13 17:31:39,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:39,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433876769] [2025-04-13 17:31:39,311 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:31:39,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:39,342 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:31:39,370 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:31:39,370 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:31:39,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:31:42,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:42,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433876769] [2025-04-13 17:31:42,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433876769] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:42,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:42,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-04-13 17:31:42,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93683456] [2025-04-13 17:31:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:42,731 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:31:42,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:42,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:31:42,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:31:42,731 INFO L87 Difference]: Start difference. First operand 16578 states and 50782 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 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-04-13 17:31:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:47,431 INFO L93 Difference]: Finished difference Result 29045 states and 88707 transitions. [2025-04-13 17:31:47,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 17:31:47,432 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 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 40 [2025-04-13 17:31:47,432 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:47,974 INFO L225 Difference]: With dead ends: 29045 [2025-04-13 17:31:47,974 INFO L226 Difference]: Without dead ends: 16834 [2025-04-13 17:31:48,004 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=1300, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 17:31:48,004 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 170 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5307 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 5307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:48,004 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 0 Invalid, 5339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 5307 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-04-13 17:31:48,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16834 states. [2025-04-13 17:31:48,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16834 to 16656. [2025-04-13 17:31:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16656 states, 16639 states have (on average 3.0665905402968927) internal successors, (51025), 16655 states have internal predecessors, (51025), 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-04-13 17:31:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16656 states to 16656 states and 51025 transitions. [2025-04-13 17:31:48,906 INFO L79 Accepts]: Start accepts. Automaton has 16656 states and 51025 transitions. Word has length 40 [2025-04-13 17:31:48,906 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:48,906 INFO L485 AbstractCegarLoop]: Abstraction has 16656 states and 51025 transitions. [2025-04-13 17:31:48,906 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 20 states have internal predecessors, (37), 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-04-13 17:31:48,906 INFO L278 IsEmpty]: Start isEmpty. Operand 16656 states and 51025 transitions. [2025-04-13 17:31:48,911 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:31:48,911 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:48,911 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:48,911 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2025-04-13 17:31:48,911 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:31:48,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:48,912 INFO L85 PathProgramCache]: Analyzing trace with hash 697899615, now seen corresponding path program 12 times [2025-04-13 17:31:48,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:48,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415832579] [2025-04-13 17:31:48,912 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:31:48,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:48,948 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:31:48,967 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:31:48,967 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:31:48,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:31:50,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:50,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415832579] [2025-04-13 17:31:50,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415832579] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:50,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:50,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:31:50,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46927140] [2025-04-13 17:31:50,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:50,618 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:31:50,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:50,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:31:50,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:31:50,618 INFO L87 Difference]: Start difference. First operand 16656 states and 51025 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:31:54,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:31:54,336 INFO L93 Difference]: Finished difference Result 30557 states and 93523 transitions. [2025-04-13 17:31:54,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:31:54,337 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:31:54,337 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:31:54,937 INFO L225 Difference]: With dead ends: 30557 [2025-04-13 17:31:54,937 INFO L226 Difference]: Without dead ends: 17584 [2025-04-13 17:31:54,960 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:31:54,962 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 227 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4084 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 4084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:31:54,963 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 0 Invalid, 4122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 4084 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-04-13 17:31:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17584 states. [2025-04-13 17:31:55,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17584 to 16680. [2025-04-13 17:31:55,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16680 states, 16663 states have (on average 3.066014523195103) internal successors, (51089), 16679 states have internal predecessors, (51089), 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-04-13 17:31:55,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16680 states to 16680 states and 51089 transitions. [2025-04-13 17:31:55,730 INFO L79 Accepts]: Start accepts. Automaton has 16680 states and 51089 transitions. Word has length 40 [2025-04-13 17:31:55,730 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:31:55,730 INFO L485 AbstractCegarLoop]: Abstraction has 16680 states and 51089 transitions. [2025-04-13 17:31:55,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:31:55,730 INFO L278 IsEmpty]: Start isEmpty. Operand 16680 states and 51089 transitions. [2025-04-13 17:31:55,735 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:31:55,735 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:31:55,735 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:31:55,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2025-04-13 17:31:55,735 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:31:55,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:31:55,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1839198379, now seen corresponding path program 1 times [2025-04-13 17:31:55,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:31:55,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435120438] [2025-04-13 17:31:55,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:31:55,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:31:55,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 17:31:55,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:31:55,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:31:55,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:31:57,749 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:31:57,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:31:57,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435120438] [2025-04-13 17:31:57,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435120438] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:31:57,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:31:57,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:31:57,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069732474] [2025-04-13 17:31:57,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:31:57,750 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:31:57,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:31:57,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:31:57,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:31:57,750 INFO L87 Difference]: Start difference. First operand 16680 states and 51089 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:32:00,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:32:00,870 INFO L93 Difference]: Finished difference Result 30903 states and 94492 transitions. [2025-04-13 17:32:00,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:32:00,870 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:32:00,870 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:32:01,394 INFO L225 Difference]: With dead ends: 30903 [2025-04-13 17:32:01,394 INFO L226 Difference]: Without dead ends: 17864 [2025-04-13 17:32:01,422 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:32:01,422 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 327 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3605 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:32:01,422 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 0 Invalid, 3648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3605 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-04-13 17:32:01,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17864 states. [2025-04-13 17:32:01,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17864 to 16682. [2025-04-13 17:32:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16682 states, 16665 states have (on average 3.0656465646564657) internal successors, (51089), 16681 states have internal predecessors, (51089), 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-04-13 17:32:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16682 states to 16682 states and 51089 transitions. [2025-04-13 17:32:02,205 INFO L79 Accepts]: Start accepts. Automaton has 16682 states and 51089 transitions. Word has length 40 [2025-04-13 17:32:02,205 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:32:02,205 INFO L485 AbstractCegarLoop]: Abstraction has 16682 states and 51089 transitions. [2025-04-13 17:32:02,205 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:32:02,205 INFO L278 IsEmpty]: Start isEmpty. Operand 16682 states and 51089 transitions. [2025-04-13 17:32:02,324 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:32:02,324 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:32:02,324 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:32:02,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2025-04-13 17:32:02,324 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:32:02,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:32:02,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1449200811, now seen corresponding path program 13 times [2025-04-13 17:32:02,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:32:02,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956170257] [2025-04-13 17:32:02,325 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:32:02,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:32:02,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 17:32:02,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:32:02,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:32:02,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:32:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:32:04,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:32:04,209 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956170257] [2025-04-13 17:32:04,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956170257] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:32:04,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:32:04,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:32:04,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109226356] [2025-04-13 17:32:04,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:32:04,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:32:04,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:32:04,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:32:04,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:32:04,210 INFO L87 Difference]: Start difference. First operand 16682 states and 51089 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:32:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:32:07,942 INFO L93 Difference]: Finished difference Result 30753 states and 94104 transitions. [2025-04-13 17:32:07,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:32:07,943 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:32:07,943 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:32:08,457 INFO L225 Difference]: With dead ends: 30753 [2025-04-13 17:32:08,457 INFO L226 Difference]: Without dead ends: 17752 [2025-04-13 17:32:08,486 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:32:08,487 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 254 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4043 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:32:08,487 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 0 Invalid, 4086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4043 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-04-13 17:32:08,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17752 states. [2025-04-13 17:32:08,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17752 to 16676. [2025-04-13 17:32:08,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16676 states, 16659 states have (on average 3.0657902635212197) internal successors, (51073), 16675 states have internal predecessors, (51073), 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-04-13 17:32:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16676 states to 16676 states and 51073 transitions. [2025-04-13 17:32:09,263 INFO L79 Accepts]: Start accepts. Automaton has 16676 states and 51073 transitions. Word has length 40 [2025-04-13 17:32:09,263 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:32:09,263 INFO L485 AbstractCegarLoop]: Abstraction has 16676 states and 51073 transitions. [2025-04-13 17:32:09,263 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:32:09,263 INFO L278 IsEmpty]: Start isEmpty. Operand 16676 states and 51073 transitions. [2025-04-13 17:32:09,268 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:32:09,269 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:32:09,269 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:32:09,269 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2025-04-13 17:32:09,269 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:32:09,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:32:09,269 INFO L85 PathProgramCache]: Analyzing trace with hash -640152903, now seen corresponding path program 2 times [2025-04-13 17:32:09,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:32:09,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609429977] [2025-04-13 17:32:09,269 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:32:09,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:32:09,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:32:09,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:32:09,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:32:09,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:32:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:32:11,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:32:11,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609429977] [2025-04-13 17:32:11,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609429977] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:32:11,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:32:11,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:32:11,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540615736] [2025-04-13 17:32:11,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:32:11,030 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:32:11,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:32:11,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:32:11,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:32:11,030 INFO L87 Difference]: Start difference. First operand 16676 states and 51073 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:32:15,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:32:15,188 INFO L93 Difference]: Finished difference Result 30865 states and 94373 transitions. [2025-04-13 17:32:15,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:32:15,188 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:32:15,188 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:32:15,827 INFO L225 Difference]: With dead ends: 30865 [2025-04-13 17:32:15,828 INFO L226 Difference]: Without dead ends: 17818 [2025-04-13 17:32:15,850 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:32:15,850 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 316 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4483 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 4483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:32:15,850 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 0 Invalid, 4525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 4483 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 17:32:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17818 states. [2025-04-13 17:32:16,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17818 to 16614. [2025-04-13 17:32:16,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16614 states, 16597 states have (on average 3.065493763933241) internal successors, (50878), 16613 states have internal predecessors, (50878), 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-04-13 17:32:16,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16614 states to 16614 states and 50878 transitions. [2025-04-13 17:32:16,640 INFO L79 Accepts]: Start accepts. Automaton has 16614 states and 50878 transitions. Word has length 40 [2025-04-13 17:32:16,640 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:32:16,641 INFO L485 AbstractCegarLoop]: Abstraction has 16614 states and 50878 transitions. [2025-04-13 17:32:16,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:32:16,641 INFO L278 IsEmpty]: Start isEmpty. Operand 16614 states and 50878 transitions. [2025-04-13 17:32:16,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:32:16,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:32:16,645 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:32:16,645 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2025-04-13 17:32:16,645 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:32:16,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:32:16,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1487618849, now seen corresponding path program 14 times [2025-04-13 17:32:16,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:32:16,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448099243] [2025-04-13 17:32:16,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:32:16,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:32:16,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:32:16,689 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:32:16,689 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:32:16,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:32:18,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:32:18,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:32:18,258 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448099243] [2025-04-13 17:32:18,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448099243] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:32:18,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:32:18,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:32:18,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879997982] [2025-04-13 17:32:18,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:32:18,259 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:32:18,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:32:18,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:32:18,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:32:18,259 INFO L87 Difference]: Start difference. First operand 16614 states and 50878 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:32:21,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:32:21,381 INFO L93 Difference]: Finished difference Result 30779 states and 94158 transitions. [2025-04-13 17:32:21,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:32:21,381 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:32:21,382 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:32:22,018 INFO L225 Difference]: With dead ends: 30779 [2025-04-13 17:32:22,018 INFO L226 Difference]: Without dead ends: 17782 [2025-04-13 17:32:22,044 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:32:22,044 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 270 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3779 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:32:22,044 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 0 Invalid, 3822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3779 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-04-13 17:32:22,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17782 states. [2025-04-13 17:32:22,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17782 to 16602. [2025-04-13 17:32:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16602 states, 16585 states have (on average 3.065782333433826) internal successors, (50846), 16601 states have internal predecessors, (50846), 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-04-13 17:32:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16602 states to 16602 states and 50846 transitions. [2025-04-13 17:32:22,768 INFO L79 Accepts]: Start accepts. Automaton has 16602 states and 50846 transitions. Word has length 40 [2025-04-13 17:32:22,768 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:32:22,768 INFO L485 AbstractCegarLoop]: Abstraction has 16602 states and 50846 transitions. [2025-04-13 17:32:22,768 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:32:22,769 INFO L278 IsEmpty]: Start isEmpty. Operand 16602 states and 50846 transitions. [2025-04-13 17:32:22,773 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:32:22,773 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:32:22,773 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:32:22,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-04-13 17:32:22,773 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:32:22,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:32:22,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1231769943, now seen corresponding path program 15 times [2025-04-13 17:32:22,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:32:22,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723609216] [2025-04-13 17:32:22,774 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:32:22,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:32:22,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:32:22,823 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:32:22,823 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:32:22,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:32:24,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:32:24,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:32:24,382 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723609216] [2025-04-13 17:32:24,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723609216] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:32:24,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:32:24,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:32:24,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190795037] [2025-04-13 17:32:24,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:32:24,382 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:32:24,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:32:24,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:32:24,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:32:24,382 INFO L87 Difference]: Start difference. First operand 16602 states and 50846 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:32:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:32:28,138 INFO L93 Difference]: Finished difference Result 30717 states and 93979 transitions. [2025-04-13 17:32:28,138 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:32:28,138 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:32:28,138 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:32:28,797 INFO L225 Difference]: With dead ends: 30717 [2025-04-13 17:32:28,797 INFO L226 Difference]: Without dead ends: 17728 [2025-04-13 17:32:28,822 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:32:28,822 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 256 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4321 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 4321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:32:28,822 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 0 Invalid, 4385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 4321 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-04-13 17:32:28,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17728 states. [2025-04-13 17:32:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17728 to 16584. [2025-04-13 17:32:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16584 states, 16567 states have (on average 3.0662159715096275) internal successors, (50798), 16583 states have internal predecessors, (50798), 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-04-13 17:32:29,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16584 states to 16584 states and 50798 transitions. [2025-04-13 17:32:29,553 INFO L79 Accepts]: Start accepts. Automaton has 16584 states and 50798 transitions. Word has length 40 [2025-04-13 17:32:29,553 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:32:29,553 INFO L485 AbstractCegarLoop]: Abstraction has 16584 states and 50798 transitions. [2025-04-13 17:32:29,553 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:32:29,553 INFO L278 IsEmpty]: Start isEmpty. Operand 16584 states and 50798 transitions. [2025-04-13 17:32:29,558 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:32:29,558 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:32:29,558 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:32:29,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2025-04-13 17:32:29,558 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:32:29,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:32:29,559 INFO L85 PathProgramCache]: Analyzing trace with hash 752792099, now seen corresponding path program 16 times [2025-04-13 17:32:29,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:32:29,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736094812] [2025-04-13 17:32:29,559 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:32:29,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:32:29,590 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:32:29,619 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:32:29,620 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:32:29,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:32:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:32:32,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:32:32,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736094812] [2025-04-13 17:32:32,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736094812] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:32:32,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:32:32,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:32:32,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498458556] [2025-04-13 17:32:32,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:32:32,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:32:32,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:32:32,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:32:32,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:32:32,104 INFO L87 Difference]: Start difference. First operand 16584 states and 50798 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:32:35,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:32:35,165 INFO L93 Difference]: Finished difference Result 30895 states and 94521 transitions. [2025-04-13 17:32:35,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:32:35,165 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:32:35,166 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:32:35,711 INFO L225 Difference]: With dead ends: 30895 [2025-04-13 17:32:35,711 INFO L226 Difference]: Without dead ends: 17918 [2025-04-13 17:32:35,738 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:32:35,739 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 254 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3382 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:32:35,739 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 0 Invalid, 3424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3382 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-04-13 17:32:35,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17918 states. [2025-04-13 17:32:35,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17918 to 16608. [2025-04-13 17:32:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16608 states, 16591 states have (on average 3.0656379965041287) internal successors, (50862), 16607 states have internal predecessors, (50862), 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-04-13 17:32:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16608 states to 16608 states and 50862 transitions. [2025-04-13 17:32:36,718 INFO L79 Accepts]: Start accepts. Automaton has 16608 states and 50862 transitions. Word has length 40 [2025-04-13 17:32:36,718 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:32:36,718 INFO L485 AbstractCegarLoop]: Abstraction has 16608 states and 50862 transitions. [2025-04-13 17:32:36,718 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:32:36,719 INFO L278 IsEmpty]: Start isEmpty. Operand 16608 states and 50862 transitions. [2025-04-13 17:32:36,723 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:32:36,723 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:32:36,723 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:32:36,723 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2025-04-13 17:32:36,723 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:32:36,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:32:36,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1286662427, now seen corresponding path program 17 times [2025-04-13 17:32:36,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:32:36,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732302645] [2025-04-13 17:32:36,724 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:32:36,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:32:36,755 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:32:36,953 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:32:36,953 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:32:36,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:32:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:32:38,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:32:38,617 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732302645] [2025-04-13 17:32:38,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732302645] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:32:38,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:32:38,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:32:38,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175454653] [2025-04-13 17:32:38,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:32:38,617 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:32:38,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:32:38,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:32:38,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:32:38,618 INFO L87 Difference]: Start difference. First operand 16608 states and 50862 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:32:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:32:42,311 INFO L93 Difference]: Finished difference Result 31251 states and 95535 transitions. [2025-04-13 17:32:42,311 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:32:42,311 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:32:42,311 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:32:42,812 INFO L225 Difference]: With dead ends: 31251 [2025-04-13 17:32:42,813 INFO L226 Difference]: Without dead ends: 18066 [2025-04-13 17:32:42,839 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:32:42,840 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 320 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4021 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 4021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:32:42,840 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 0 Invalid, 4094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 4021 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-04-13 17:32:42,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18066 states. [2025-04-13 17:32:43,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18066 to 16616. [2025-04-13 17:32:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16616 states, 16599 states have (on average 3.06548587264293) internal successors, (50884), 16615 states have internal predecessors, (50884), 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-04-13 17:32:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16616 states to 16616 states and 50884 transitions. [2025-04-13 17:32:43,770 INFO L79 Accepts]: Start accepts. Automaton has 16616 states and 50884 transitions. Word has length 40 [2025-04-13 17:32:43,770 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:32:43,770 INFO L485 AbstractCegarLoop]: Abstraction has 16616 states and 50884 transitions. [2025-04-13 17:32:43,771 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:32:43,771 INFO L278 IsEmpty]: Start isEmpty. Operand 16616 states and 50884 transitions. [2025-04-13 17:32:43,776 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:32:43,776 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:32:43,776 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:32:43,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2025-04-13 17:32:43,776 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:32:43,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:32:43,776 INFO L85 PathProgramCache]: Analyzing trace with hash -195262851, now seen corresponding path program 18 times [2025-04-13 17:32:43,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:32:43,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63735082] [2025-04-13 17:32:43,777 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:32:43,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:32:43,828 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:32:43,861 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:32:43,861 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:32:43,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:32:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:32:45,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:32:45,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63735082] [2025-04-13 17:32:45,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63735082] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:32:45,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:32:45,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:32:45,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567462476] [2025-04-13 17:32:45,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:32:45,766 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:32:45,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:32:45,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:32:45,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:32:45,766 INFO L87 Difference]: Start difference. First operand 16616 states and 50884 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:32:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:32:50,252 INFO L93 Difference]: Finished difference Result 30877 states and 94379 transitions. [2025-04-13 17:32:50,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:32:50,252 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:32:50,252 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:32:50,752 INFO L225 Difference]: With dead ends: 30877 [2025-04-13 17:32:50,753 INFO L226 Difference]: Without dead ends: 17876 [2025-04-13 17:32:50,777 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:32:50,777 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 311 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4875 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:32:50,777 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 0 Invalid, 4915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 4875 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-04-13 17:32:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17876 states. [2025-04-13 17:32:50,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17876 to 16610. [2025-04-13 17:32:50,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16610 states, 16593 states have (on average 3.065630084975592) internal successors, (50868), 16609 states have internal predecessors, (50868), 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-04-13 17:32:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16610 states to 16610 states and 50868 transitions. [2025-04-13 17:32:51,521 INFO L79 Accepts]: Start accepts. Automaton has 16610 states and 50868 transitions. Word has length 40 [2025-04-13 17:32:51,521 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:32:51,521 INFO L485 AbstractCegarLoop]: Abstraction has 16610 states and 50868 transitions. [2025-04-13 17:32:51,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:32:51,521 INFO L278 IsEmpty]: Start isEmpty. Operand 16610 states and 50868 transitions. [2025-04-13 17:32:51,526 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:32:51,526 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:32:51,526 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:32:51,526 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2025-04-13 17:32:51,526 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:32:51,526 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:32:51,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1809259393, now seen corresponding path program 19 times [2025-04-13 17:32:51,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:32:51,526 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122972011] [2025-04-13 17:32:51,526 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:32:51,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:32:51,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 17:32:51,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:32:51,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:32:51,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:32:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:32:53,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:32:53,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122972011] [2025-04-13 17:32:53,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122972011] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:32:53,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:32:53,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:32:53,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691291213] [2025-04-13 17:32:53,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:32:53,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:32:53,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:32:53,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:32:53,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:32:53,391 INFO L87 Difference]: Start difference. First operand 16610 states and 50868 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:32:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:32:57,933 INFO L93 Difference]: Finished difference Result 30903 states and 94458 transitions. [2025-04-13 17:32:57,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 17:32:57,933 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:32:57,933 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:32:58,469 INFO L225 Difference]: With dead ends: 30903 [2025-04-13 17:32:58,470 INFO L226 Difference]: Without dead ends: 17906 [2025-04-13 17:32:58,496 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:32:58,498 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 332 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4887 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 4887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:32:58,498 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 0 Invalid, 4959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 4887 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-04-13 17:32:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17906 states. [2025-04-13 17:32:58,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17906 to 16586. [2025-04-13 17:32:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16586 states, 16569 states have (on average 3.066207978755507) internal successors, (50804), 16585 states have internal predecessors, (50804), 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-04-13 17:32:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16586 states to 16586 states and 50804 transitions. [2025-04-13 17:32:59,280 INFO L79 Accepts]: Start accepts. Automaton has 16586 states and 50804 transitions. Word has length 40 [2025-04-13 17:32:59,280 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:32:59,280 INFO L485 AbstractCegarLoop]: Abstraction has 16586 states and 50804 transitions. [2025-04-13 17:32:59,280 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:32:59,280 INFO L278 IsEmpty]: Start isEmpty. Operand 16586 states and 50804 transitions. [2025-04-13 17:32:59,284 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:32:59,284 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:32:59,284 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:32:59,284 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2025-04-13 17:32:59,284 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:32:59,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:32:59,285 INFO L85 PathProgramCache]: Analyzing trace with hash 2100397377, now seen corresponding path program 20 times [2025-04-13 17:32:59,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:32:59,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599012308] [2025-04-13 17:32:59,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:32:59,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:32:59,316 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:32:59,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:32:59,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:32:59,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:00,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:33:00,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:00,984 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599012308] [2025-04-13 17:33:00,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599012308] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:00,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:00,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:33:00,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178379228] [2025-04-13 17:33:00,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:00,985 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:33:00,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:00,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:33:00,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:33:00,985 INFO L87 Difference]: Start difference. First operand 16586 states and 50804 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:33:05,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:05,024 INFO L93 Difference]: Finished difference Result 30391 states and 93009 transitions. [2025-04-13 17:33:05,024 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:33:05,024 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:33:05,024 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:05,537 INFO L225 Difference]: With dead ends: 30391 [2025-04-13 17:33:05,537 INFO L226 Difference]: Without dead ends: 17410 [2025-04-13 17:33:05,563 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:33:05,563 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4689 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:05,563 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 4715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 4689 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 17:33:05,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17410 states. [2025-04-13 17:33:05,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17410 to 16598. [2025-04-13 17:33:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16598 states, 16581 states have (on average 3.0659188227489294) internal successors, (50836), 16597 states have internal predecessors, (50836), 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-04-13 17:33:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16598 states to 16598 states and 50836 transitions. [2025-04-13 17:33:06,321 INFO L79 Accepts]: Start accepts. Automaton has 16598 states and 50836 transitions. Word has length 40 [2025-04-13 17:33:06,321 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:06,321 INFO L485 AbstractCegarLoop]: Abstraction has 16598 states and 50836 transitions. [2025-04-13 17:33:06,321 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:33:06,321 INFO L278 IsEmpty]: Start isEmpty. Operand 16598 states and 50836 transitions. [2025-04-13 17:33:06,326 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:33:06,326 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:06,326 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:06,326 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2025-04-13 17:33:06,326 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:33:06,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:06,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1772335797, now seen corresponding path program 21 times [2025-04-13 17:33:06,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:06,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731154107] [2025-04-13 17:33:06,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:33:06,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:06,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:33:06,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:33:06,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:33:06,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:33:08,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:08,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731154107] [2025-04-13 17:33:08,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731154107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:08,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:08,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:33:08,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287403415] [2025-04-13 17:33:08,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:08,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:33:08,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:08,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:33:08,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:33:08,133 INFO L87 Difference]: Start difference. First operand 16598 states and 50836 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:33:12,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:12,853 INFO L93 Difference]: Finished difference Result 31133 states and 95184 transitions. [2025-04-13 17:33:12,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:33:12,853 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:33:12,853 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:13,371 INFO L225 Difference]: With dead ends: 31133 [2025-04-13 17:33:13,371 INFO L226 Difference]: Without dead ends: 17952 [2025-04-13 17:33:13,402 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:33:13,402 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5446 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 5446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:13,402 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 5492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 5446 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-04-13 17:33:13,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17952 states. [2025-04-13 17:33:13,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17952 to 16666. [2025-04-13 17:33:13,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16666 states, 16649 states have (on average 3.064448315214127) internal successors, (51020), 16665 states have internal predecessors, (51020), 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-04-13 17:33:13,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 51020 transitions. [2025-04-13 17:33:14,167 INFO L79 Accepts]: Start accepts. Automaton has 16666 states and 51020 transitions. Word has length 40 [2025-04-13 17:33:14,168 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:14,168 INFO L485 AbstractCegarLoop]: Abstraction has 16666 states and 51020 transitions. [2025-04-13 17:33:14,168 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:33:14,168 INFO L278 IsEmpty]: Start isEmpty. Operand 16666 states and 51020 transitions. [2025-04-13 17:33:14,172 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:33:14,172 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:14,172 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:14,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-04-13 17:33:14,173 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:33:14,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:14,173 INFO L85 PathProgramCache]: Analyzing trace with hash -46703049, now seen corresponding path program 22 times [2025-04-13 17:33:14,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:14,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211867360] [2025-04-13 17:33:14,173 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:33:14,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:14,204 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:33:14,237 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:33:14,237 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:33:14,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:33:17,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:17,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211867360] [2025-04-13 17:33:17,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211867360] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:17,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:17,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:33:17,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280964421] [2025-04-13 17:33:17,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:17,621 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:33:17,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:17,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:33:17,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:33:17,621 INFO L87 Difference]: Start difference. First operand 16666 states and 51020 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:33:20,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:20,713 INFO L93 Difference]: Finished difference Result 31016 states and 94792 transitions. [2025-04-13 17:33:20,714 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:33:20,714 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:33:20,714 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:21,350 INFO L225 Difference]: With dead ends: 31016 [2025-04-13 17:33:21,350 INFO L226 Difference]: Without dead ends: 17723 [2025-04-13 17:33:21,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:33:21,376 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 229 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3607 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:21,376 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 0 Invalid, 3656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3607 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-04-13 17:33:21,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17723 states. [2025-04-13 17:33:21,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17723 to 16680. [2025-04-13 17:33:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16680 states, 16663 states have (on average 3.0662545760067217) internal successors, (51093), 16679 states have internal predecessors, (51093), 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-04-13 17:33:21,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16680 states to 16680 states and 51093 transitions. [2025-04-13 17:33:22,215 INFO L79 Accepts]: Start accepts. Automaton has 16680 states and 51093 transitions. Word has length 40 [2025-04-13 17:33:22,215 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:22,215 INFO L485 AbstractCegarLoop]: Abstraction has 16680 states and 51093 transitions. [2025-04-13 17:33:22,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:33:22,215 INFO L278 IsEmpty]: Start isEmpty. Operand 16680 states and 51093 transitions. [2025-04-13 17:33:22,220 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:33:22,220 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:22,220 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:22,220 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2025-04-13 17:33:22,220 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:33:22,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:22,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1323586023, now seen corresponding path program 23 times [2025-04-13 17:33:22,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:22,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561768585] [2025-04-13 17:33:22,221 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:33:22,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:22,252 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:33:22,278 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:33:22,278 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:33:22,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:23,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:33:23,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:23,982 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561768585] [2025-04-13 17:33:23,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561768585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:23,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:23,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:33:23,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696163507] [2025-04-13 17:33:23,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:23,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:33:23,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:23,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:33:23,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:33:23,983 INFO L87 Difference]: Start difference. First operand 16680 states and 51093 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:33:28,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:28,483 INFO L93 Difference]: Finished difference Result 30999 states and 94787 transitions. [2025-04-13 17:33:28,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 17:33:28,484 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:33:28,484 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:28,989 INFO L225 Difference]: With dead ends: 30999 [2025-04-13 17:33:28,989 INFO L226 Difference]: Without dead ends: 17946 [2025-04-13 17:33:29,017 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=752, Unknown=0, NotChecked=0, Total=870 [2025-04-13 17:33:29,018 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 265 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4796 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 4796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:29,018 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 0 Invalid, 4851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 4796 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-04-13 17:33:29,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17946 states. [2025-04-13 17:33:29,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17946 to 16674. [2025-04-13 17:33:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16674 states, 16657 states have (on average 3.0663985111364593) internal successors, (51077), 16673 states have internal predecessors, (51077), 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-04-13 17:33:29,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16674 states to 16674 states and 51077 transitions. [2025-04-13 17:33:29,757 INFO L79 Accepts]: Start accepts. Automaton has 16674 states and 51077 transitions. Word has length 40 [2025-04-13 17:33:29,757 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:29,757 INFO L485 AbstractCegarLoop]: Abstraction has 16674 states and 51077 transitions. [2025-04-13 17:33:29,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:33:29,757 INFO L278 IsEmpty]: Start isEmpty. Operand 16674 states and 51077 transitions. [2025-04-13 17:33:29,761 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:33:29,761 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:29,761 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:29,761 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2025-04-13 17:33:29,761 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:33:29,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:29,762 INFO L85 PathProgramCache]: Analyzing trace with hash -85121087, now seen corresponding path program 24 times [2025-04-13 17:33:29,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:29,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461320207] [2025-04-13 17:33:29,762 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:33:29,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:29,793 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:33:29,805 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:33:29,806 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:33:29,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:31,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:33:31,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:31,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461320207] [2025-04-13 17:33:31,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461320207] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:31,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:31,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:33:31,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248206307] [2025-04-13 17:33:31,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:31,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:33:31,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:31,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:33:31,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:33:31,350 INFO L87 Difference]: Start difference. First operand 16674 states and 51077 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:33:35,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:35,105 INFO L93 Difference]: Finished difference Result 30543 states and 93141 transitions. [2025-04-13 17:33:35,105 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:33:35,105 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:33:35,105 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:35,618 INFO L225 Difference]: With dead ends: 30543 [2025-04-13 17:33:35,618 INFO L226 Difference]: Without dead ends: 17590 [2025-04-13 17:33:35,645 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:33:35,646 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 182 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4325 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 4325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:35,646 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 0 Invalid, 4355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 4325 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-04-13 17:33:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17590 states. [2025-04-13 17:33:35,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17590 to 16680. [2025-04-13 17:33:35,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16680 states, 16663 states have (on average 3.066974734441577) internal successors, (51105), 16679 states have internal predecessors, (51105), 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-04-13 17:33:35,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16680 states to 16680 states and 51105 transitions. [2025-04-13 17:33:36,411 INFO L79 Accepts]: Start accepts. Automaton has 16680 states and 51105 transitions. Word has length 40 [2025-04-13 17:33:36,411 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:36,411 INFO L485 AbstractCegarLoop]: Abstraction has 16680 states and 51105 transitions. [2025-04-13 17:33:36,412 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:33:36,412 INFO L278 IsEmpty]: Start isEmpty. Operand 16680 states and 51105 transitions. [2025-04-13 17:33:36,416 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:33:36,416 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:36,416 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:36,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2025-04-13 17:33:36,416 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:33:36,416 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:36,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1657575327, now seen corresponding path program 25 times [2025-04-13 17:33:36,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:36,416 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110714353] [2025-04-13 17:33:36,416 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:33:36,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:36,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 17:33:36,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:33:36,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:33:36,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:33:38,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:38,331 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110714353] [2025-04-13 17:33:38,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110714353] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:38,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:38,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:33:38,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67817275] [2025-04-13 17:33:38,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:38,332 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:33:38,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:38,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:33:38,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:33:38,332 INFO L87 Difference]: Start difference. First operand 16680 states and 51105 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:33:42,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:42,581 INFO L93 Difference]: Finished difference Result 30929 states and 94619 transitions. [2025-04-13 17:33:42,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:33:42,581 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:33:42,581 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:43,088 INFO L225 Difference]: With dead ends: 30929 [2025-04-13 17:33:43,088 INFO L226 Difference]: Without dead ends: 17876 [2025-04-13 17:33:43,114 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:33:43,115 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4768 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 4768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:43,115 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 0 Invalid, 4816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 4768 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 17:33:43,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17876 states. [2025-04-13 17:33:43,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17876 to 16668. [2025-04-13 17:33:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16668 states, 16651 states have (on average 3.067263227433788) internal successors, (51073), 16667 states have internal predecessors, (51073), 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-04-13 17:33:43,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16668 states to 16668 states and 51073 transitions. [2025-04-13 17:33:43,908 INFO L79 Accepts]: Start accepts. Automaton has 16668 states and 51073 transitions. Word has length 40 [2025-04-13 17:33:43,908 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:43,908 INFO L485 AbstractCegarLoop]: Abstraction has 16668 states and 51073 transitions. [2025-04-13 17:33:43,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:33:43,908 INFO L278 IsEmpty]: Start isEmpty. Operand 16668 states and 51073 transitions. [2025-04-13 17:33:43,912 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:33:43,912 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:43,912 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:43,912 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-04-13 17:33:43,913 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:33:43,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:43,913 INFO L85 PathProgramCache]: Analyzing trace with hash -687832137, now seen corresponding path program 26 times [2025-04-13 17:33:43,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:43,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633981741] [2025-04-13 17:33:43,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:33:43,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:43,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:33:43,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:33:43,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:33:43,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:33:45,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:45,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633981741] [2025-04-13 17:33:45,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633981741] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:45,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:45,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:33:45,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35771110] [2025-04-13 17:33:45,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:45,682 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:33:45,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:45,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:33:45,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:33:45,682 INFO L87 Difference]: Start difference. First operand 16668 states and 51073 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:33:49,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:49,930 INFO L93 Difference]: Finished difference Result 30623 states and 93389 transitions. [2025-04-13 17:33:49,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:33:49,930 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:33:49,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:50,445 INFO L225 Difference]: With dead ends: 30623 [2025-04-13 17:33:50,445 INFO L226 Difference]: Without dead ends: 17674 [2025-04-13 17:33:50,471 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:33:50,471 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 208 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5033 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 5033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:50,471 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 0 Invalid, 5076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 5033 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 17:33:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2025-04-13 17:33:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 16674. [2025-04-13 17:33:50,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16674 states, 16657 states have (on average 3.0678393468211564) internal successors, (51101), 16673 states have internal predecessors, (51101), 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-04-13 17:33:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16674 states to 16674 states and 51101 transitions. [2025-04-13 17:33:51,405 INFO L79 Accepts]: Start accepts. Automaton has 16674 states and 51101 transitions. Word has length 40 [2025-04-13 17:33:51,405 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:51,405 INFO L485 AbstractCegarLoop]: Abstraction has 16674 states and 51101 transitions. [2025-04-13 17:33:51,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:33:51,405 INFO L278 IsEmpty]: Start isEmpty. Operand 16674 states and 51101 transitions. [2025-04-13 17:33:51,409 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:33:51,409 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:51,410 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:51,410 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2025-04-13 17:33:51,410 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:33:51,410 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:51,410 INFO L85 PathProgramCache]: Analyzing trace with hash -833588801, now seen corresponding path program 27 times [2025-04-13 17:33:51,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:51,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927931838] [2025-04-13 17:33:51,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:33:51,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:51,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:33:51,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:33:51,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:33:51,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:33:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:33:53,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:33:53,621 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927931838] [2025-04-13 17:33:53,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927931838] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:33:53,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:33:53,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:33:53,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680346655] [2025-04-13 17:33:53,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:33:53,622 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:33:53,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:33:53,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:33:53,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:33:53,622 INFO L87 Difference]: Start difference. First operand 16674 states and 51101 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:33:57,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:33:57,970 INFO L93 Difference]: Finished difference Result 30623 states and 93760 transitions. [2025-04-13 17:33:57,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:33:57,970 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:33:57,970 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:33:58,483 INFO L225 Difference]: With dead ends: 30623 [2025-04-13 17:33:58,483 INFO L226 Difference]: Without dead ends: 17382 [2025-04-13 17:33:58,510 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:33:58,511 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 162 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4790 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 4790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:33:58,511 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 0 Invalid, 4826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 4790 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-04-13 17:33:58,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17382 states. [2025-04-13 17:33:58,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17382 to 16674. [2025-04-13 17:33:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16674 states, 16657 states have (on average 3.0678393468211564) internal successors, (51101), 16673 states have internal predecessors, (51101), 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-04-13 17:33:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16674 states to 16674 states and 51101 transitions. [2025-04-13 17:33:59,243 INFO L79 Accepts]: Start accepts. Automaton has 16674 states and 51101 transitions. Word has length 40 [2025-04-13 17:33:59,243 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:33:59,243 INFO L485 AbstractCegarLoop]: Abstraction has 16674 states and 51101 transitions. [2025-04-13 17:33:59,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:33:59,243 INFO L278 IsEmpty]: Start isEmpty. Operand 16674 states and 51101 transitions. [2025-04-13 17:33:59,247 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:33:59,247 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:33:59,247 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:33:59,248 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2025-04-13 17:33:59,248 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:33:59,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:33:59,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1136182719, now seen corresponding path program 28 times [2025-04-13 17:33:59,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:33:59,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186904038] [2025-04-13 17:33:59,248 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:33:59,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:33:59,280 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:33:59,305 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:33:59,305 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:33:59,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:01,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:01,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186904038] [2025-04-13 17:34:01,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186904038] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:34:01,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:34:01,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:34:01,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828952569] [2025-04-13 17:34:01,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:34:01,138 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:34:01,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:01,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:34:01,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:34:01,138 INFO L87 Difference]: Start difference. First operand 16674 states and 51101 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:34:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:05,091 INFO L93 Difference]: Finished difference Result 31408 states and 95817 transitions. [2025-04-13 17:34:05,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:34:05,091 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:34:05,091 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:05,611 INFO L225 Difference]: With dead ends: 31408 [2025-04-13 17:34:05,612 INFO L226 Difference]: Without dead ends: 18455 [2025-04-13 17:34:05,638 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:34:05,639 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 333 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4409 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 4409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:05,639 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 0 Invalid, 4470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 4409 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-04-13 17:34:05,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18455 states. [2025-04-13 17:34:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18455 to 16634. [2025-04-13 17:34:05,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16634 states, 16617 states have (on average 3.067882289221881) internal successors, (50979), 16633 states have internal predecessors, (50979), 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-04-13 17:34:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16634 states to 16634 states and 50979 transitions. [2025-04-13 17:34:06,407 INFO L79 Accepts]: Start accepts. Automaton has 16634 states and 50979 transitions. Word has length 40 [2025-04-13 17:34:06,407 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:06,407 INFO L485 AbstractCegarLoop]: Abstraction has 16634 states and 50979 transitions. [2025-04-13 17:34:06,407 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:34:06,408 INFO L278 IsEmpty]: Start isEmpty. Operand 16634 states and 50979 transitions. [2025-04-13 17:34:06,412 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:34:06,412 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:06,412 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:06,412 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2025-04-13 17:34:06,412 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:34:06,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:06,412 INFO L85 PathProgramCache]: Analyzing trace with hash 544067891, now seen corresponding path program 29 times [2025-04-13 17:34:06,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:06,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331095411] [2025-04-13 17:34:06,412 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:34:06,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:06,444 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:34:06,468 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:34:06,468 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:34:06,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:08,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:08,335 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331095411] [2025-04-13 17:34:08,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331095411] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:34:08,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:34:08,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:34:08,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476509687] [2025-04-13 17:34:08,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:34:08,336 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:34:08,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:08,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:34:08,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:34:08,336 INFO L87 Difference]: Start difference. First operand 16634 states and 50979 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:34:12,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:12,567 INFO L93 Difference]: Finished difference Result 31353 states and 95886 transitions. [2025-04-13 17:34:12,567 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:34:12,567 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:34:12,567 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:13,204 INFO L225 Difference]: With dead ends: 31353 [2025-04-13 17:34:13,205 INFO L226 Difference]: Without dead ends: 18144 [2025-04-13 17:34:13,233 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2025-04-13 17:34:13,236 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 319 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4447 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 4447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:13,237 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 0 Invalid, 4517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4447 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-04-13 17:34:13,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18144 states. [2025-04-13 17:34:13,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18144 to 16670. [2025-04-13 17:34:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16670 states, 16653 states have (on average 3.067014952260854) internal successors, (51075), 16669 states have internal predecessors, (51075), 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-04-13 17:34:13,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16670 states to 16670 states and 51075 transitions. [2025-04-13 17:34:14,073 INFO L79 Accepts]: Start accepts. Automaton has 16670 states and 51075 transitions. Word has length 40 [2025-04-13 17:34:14,073 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:14,073 INFO L485 AbstractCegarLoop]: Abstraction has 16670 states and 51075 transitions. [2025-04-13 17:34:14,073 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:34:14,074 INFO L278 IsEmpty]: Start isEmpty. Operand 16670 states and 51075 transitions. [2025-04-13 17:34:14,078 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:34:14,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:14,078 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:14,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2025-04-13 17:34:14,078 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:34:14,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:14,079 INFO L85 PathProgramCache]: Analyzing trace with hash 790267201, now seen corresponding path program 30 times [2025-04-13 17:34:14,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:14,079 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440625811] [2025-04-13 17:34:14,079 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:34:14,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:14,113 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:34:14,127 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:34:14,127 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:34:14,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:15,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:15,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:15,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440625811] [2025-04-13 17:34:15,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440625811] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:34:15,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:34:15,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:34:15,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406641361] [2025-04-13 17:34:15,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:34:15,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:34:15,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:15,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:34:15,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:34:15,682 INFO L87 Difference]: Start difference. First operand 16670 states and 51075 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:34:19,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:19,230 INFO L93 Difference]: Finished difference Result 30653 states and 93798 transitions. [2025-04-13 17:34:19,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:34:19,230 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:34:19,230 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:19,743 INFO L225 Difference]: With dead ends: 30653 [2025-04-13 17:34:19,743 INFO L226 Difference]: Without dead ends: 17612 [2025-04-13 17:34:19,769 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:34:19,770 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 223 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3878 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 3878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:19,770 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 0 Invalid, 3928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 3878 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 17:34:19,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17612 states. [2025-04-13 17:34:19,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17612 to 16682. [2025-04-13 17:34:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16682 states, 16665 states have (on average 3.066726672667267) internal successors, (51107), 16681 states have internal predecessors, (51107), 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-04-13 17:34:20,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16682 states to 16682 states and 51107 transitions. [2025-04-13 17:34:20,538 INFO L79 Accepts]: Start accepts. Automaton has 16682 states and 51107 transitions. Word has length 40 [2025-04-13 17:34:20,538 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:20,538 INFO L485 AbstractCegarLoop]: Abstraction has 16682 states and 51107 transitions. [2025-04-13 17:34:20,538 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:34:20,538 INFO L278 IsEmpty]: Start isEmpty. Operand 16682 states and 51107 transitions. [2025-04-13 17:34:20,543 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:34:20,543 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:20,543 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:20,543 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2025-04-13 17:34:20,543 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:34:20,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:20,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1743113367, now seen corresponding path program 31 times [2025-04-13 17:34:20,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:20,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771372263] [2025-04-13 17:34:20,543 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:34:20,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:20,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 17:34:20,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:34:20,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:34:20,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:22,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:22,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771372263] [2025-04-13 17:34:22,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771372263] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:34:22,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:34:22,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:34:22,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341656177] [2025-04-13 17:34:22,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:34:22,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:34:22,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:22,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:34:22,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:34:22,789 INFO L87 Difference]: Start difference. First operand 16682 states and 51107 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:34:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:26,939 INFO L93 Difference]: Finished difference Result 30983 states and 94748 transitions. [2025-04-13 17:34:26,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:34:26,939 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:34:26,939 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:27,448 INFO L225 Difference]: With dead ends: 30983 [2025-04-13 17:34:27,449 INFO L226 Difference]: Without dead ends: 17934 [2025-04-13 17:34:27,475 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:34:27,475 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 278 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4439 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 4439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:27,475 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 0 Invalid, 4510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 4439 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 17:34:27,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17934 states. [2025-04-13 17:34:27,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17934 to 16640. [2025-04-13 17:34:27,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16640 states, 16623 states have (on average 3.067737472177104) internal successors, (50995), 16639 states have internal predecessors, (50995), 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-04-13 17:34:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16640 states to 16640 states and 50995 transitions. [2025-04-13 17:34:28,487 INFO L79 Accepts]: Start accepts. Automaton has 16640 states and 50995 transitions. Word has length 40 [2025-04-13 17:34:28,488 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:28,488 INFO L485 AbstractCegarLoop]: Abstraction has 16640 states and 50995 transitions. [2025-04-13 17:34:28,488 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:34:28,488 INFO L278 IsEmpty]: Start isEmpty. Operand 16640 states and 50995 transitions. [2025-04-13 17:34:28,492 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:34:28,492 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:28,492 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:28,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2025-04-13 17:34:28,493 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:34:28,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:28,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1356833225, now seen corresponding path program 32 times [2025-04-13 17:34:28,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:28,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266337783] [2025-04-13 17:34:28,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:34:28,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:28,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:34:28,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:34:28,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:34:28,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:30,210 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:30,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:30,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266337783] [2025-04-13 17:34:30,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266337783] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:34:30,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:34:30,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:34:30,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007241259] [2025-04-13 17:34:30,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:34:30,211 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:34:30,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:30,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:34:30,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:34:30,211 INFO L87 Difference]: Start difference. First operand 16640 states and 50995 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:34:33,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:33,914 INFO L93 Difference]: Finished difference Result 30721 states and 94027 transitions. [2025-04-13 17:34:33,914 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:34:33,914 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:34:33,914 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:34,439 INFO L225 Difference]: With dead ends: 30721 [2025-04-13 17:34:34,439 INFO L226 Difference]: Without dead ends: 17700 [2025-04-13 17:34:34,464 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:34:34,464 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4360 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 4360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:34,464 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 4413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 4360 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-04-13 17:34:34,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17700 states. [2025-04-13 17:34:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17700 to 16634. [2025-04-13 17:34:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16634 states, 16617 states have (on average 3.067882289221881) internal successors, (50979), 16633 states have internal predecessors, (50979), 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-04-13 17:34:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16634 states to 16634 states and 50979 transitions. [2025-04-13 17:34:35,244 INFO L79 Accepts]: Start accepts. Automaton has 16634 states and 50979 transitions. Word has length 40 [2025-04-13 17:34:35,244 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:35,244 INFO L485 AbstractCegarLoop]: Abstraction has 16634 states and 50979 transitions. [2025-04-13 17:34:35,244 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:34:35,244 INFO L278 IsEmpty]: Start isEmpty. Operand 16634 states and 50979 transitions. [2025-04-13 17:34:35,248 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:34:35,249 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:35,249 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:35,249 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2025-04-13 17:34:35,249 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:34:35,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:35,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1395251263, now seen corresponding path program 33 times [2025-04-13 17:34:35,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:35,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949399882] [2025-04-13 17:34:35,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:34:35,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:35,281 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:34:35,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:34:35,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:34:35,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:37,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:37,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949399882] [2025-04-13 17:34:37,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949399882] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:34:37,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:34:37,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:34:37,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94161283] [2025-04-13 17:34:37,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:34:37,065 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:34:37,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:37,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:34:37,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:34:37,066 INFO L87 Difference]: Start difference. First operand 16634 states and 50979 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:34:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:41,543 INFO L93 Difference]: Finished difference Result 30759 states and 94147 transitions. [2025-04-13 17:34:41,543 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:34:41,543 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:34:41,543 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:42,084 INFO L225 Difference]: With dead ends: 30759 [2025-04-13 17:34:42,084 INFO L226 Difference]: Without dead ends: 17742 [2025-04-13 17:34:42,111 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:34:42,111 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 207 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4984 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 4984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:42,111 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 0 Invalid, 5034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 4984 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-04-13 17:34:42,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17742 states. [2025-04-13 17:34:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17742 to 16622. [2025-04-13 17:34:42,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16622 states, 16605 states have (on average 3.0681722372779285) internal successors, (50947), 16621 states have internal predecessors, (50947), 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-04-13 17:34:42,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16622 states to 16622 states and 50947 transitions. [2025-04-13 17:34:42,886 INFO L79 Accepts]: Start accepts. Automaton has 16622 states and 50947 transitions. Word has length 40 [2025-04-13 17:34:42,886 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:42,886 INFO L485 AbstractCegarLoop]: Abstraction has 16622 states and 50947 transitions. [2025-04-13 17:34:42,886 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:34:42,886 INFO L278 IsEmpty]: Start isEmpty. Operand 16622 states and 50947 transitions. [2025-04-13 17:34:42,890 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:34:42,890 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:42,891 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:42,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2025-04-13 17:34:42,891 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:34:42,891 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:42,891 INFO L85 PathProgramCache]: Analyzing trace with hash 845159685, now seen corresponding path program 34 times [2025-04-13 17:34:42,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:42,891 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135395352] [2025-04-13 17:34:42,891 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:34:42,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:42,922 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:34:42,945 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:34:42,946 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:34:42,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:45,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:45,236 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135395352] [2025-04-13 17:34:45,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135395352] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:34:45,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:34:45,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:34:45,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662563531] [2025-04-13 17:34:45,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:34:45,236 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:34:45,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:45,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:34:45,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:34:45,237 INFO L87 Difference]: Start difference. First operand 16622 states and 50947 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:34:49,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:49,046 INFO L93 Difference]: Finished difference Result 30805 states and 94269 transitions. [2025-04-13 17:34:49,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:34:49,046 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:34:49,046 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:49,593 INFO L225 Difference]: With dead ends: 30805 [2025-04-13 17:34:49,594 INFO L226 Difference]: Without dead ends: 17796 [2025-04-13 17:34:49,621 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:34:49,622 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 217 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4109 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 4109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:49,622 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 0 Invalid, 4159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 4109 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-04-13 17:34:49,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17796 states. [2025-04-13 17:34:49,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17796 to 16640. [2025-04-13 17:34:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16640 states, 16623 states have (on average 3.067737472177104) internal successors, (50995), 16639 states have internal predecessors, (50995), 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-04-13 17:34:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16640 states to 16640 states and 50995 transitions. [2025-04-13 17:34:50,484 INFO L79 Accepts]: Start accepts. Automaton has 16640 states and 50995 transitions. Word has length 40 [2025-04-13 17:34:50,484 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:50,484 INFO L485 AbstractCegarLoop]: Abstraction has 16640 states and 50995 transitions. [2025-04-13 17:34:50,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:34:50,484 INFO L278 IsEmpty]: Start isEmpty. Operand 16640 states and 50995 transitions. [2025-04-13 17:34:50,489 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:34:50,489 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:50,489 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:50,490 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2025-04-13 17:34:50,490 INFO L403 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:34:50,490 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:50,490 INFO L85 PathProgramCache]: Analyzing trace with hash -102895265, now seen corresponding path program 35 times [2025-04-13 17:34:50,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:50,490 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054039988] [2025-04-13 17:34:50,490 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:34:50,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:50,535 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:34:50,563 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:34:50,563 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:34:50,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:34:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:34:53,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:34:53,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054039988] [2025-04-13 17:34:53,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054039988] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:34:53,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:34:53,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:34:53,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171506722] [2025-04-13 17:34:53,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:34:53,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:34:53,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:34:53,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:34:53,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:34:53,431 INFO L87 Difference]: Start difference. First operand 16640 states and 50995 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:34:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:34:57,191 INFO L93 Difference]: Finished difference Result 30715 states and 93994 transitions. [2025-04-13 17:34:57,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:34:57,191 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:34:57,191 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:34:57,732 INFO L225 Difference]: With dead ends: 30715 [2025-04-13 17:34:57,732 INFO L226 Difference]: Without dead ends: 17694 [2025-04-13 17:34:57,760 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:34:57,760 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 212 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4095 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 4095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:34:57,760 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 0 Invalid, 4145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 4095 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-04-13 17:34:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17694 states. [2025-04-13 17:34:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17694 to 16616. [2025-04-13 17:34:57,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16616 states, 16599 states have (on average 3.0683173685161758) internal successors, (50931), 16615 states have internal predecessors, (50931), 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-04-13 17:34:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16616 states to 16616 states and 50931 transitions. [2025-04-13 17:34:58,554 INFO L79 Accepts]: Start accepts. Automaton has 16616 states and 50931 transitions. Word has length 40 [2025-04-13 17:34:58,555 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:34:58,555 INFO L485 AbstractCegarLoop]: Abstraction has 16616 states and 50931 transitions. [2025-04-13 17:34:58,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:34:58,555 INFO L278 IsEmpty]: Start isEmpty. Operand 16616 states and 50931 transitions. [2025-04-13 17:34:58,559 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:34:58,559 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:34:58,559 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:34:58,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2025-04-13 17:34:58,559 INFO L403 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:34:58,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:34:58,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1330833055, now seen corresponding path program 36 times [2025-04-13 17:34:58,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:34:58,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603842472] [2025-04-13 17:34:58,560 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:34:58,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:34:58,592 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:34:58,606 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:34:58,606 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:34:58,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:35:00,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:00,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603842472] [2025-04-13 17:35:00,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603842472] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:35:00,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:35:00,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:35:00,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300966398] [2025-04-13 17:35:00,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:35:00,132 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:35:00,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:00,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:35:00,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:35:00,132 INFO L87 Difference]: Start difference. First operand 16616 states and 50931 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:35:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:04,129 INFO L93 Difference]: Finished difference Result 30623 states and 93738 transitions. [2025-04-13 17:35:04,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:35:04,129 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:35:04,129 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:04,661 INFO L225 Difference]: With dead ends: 30623 [2025-04-13 17:35:04,661 INFO L226 Difference]: Without dead ends: 17618 [2025-04-13 17:35:04,687 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:35:04,688 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 193 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4435 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 4435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:04,688 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 0 Invalid, 4481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 4435 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 17:35:04,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17618 states. [2025-04-13 17:35:04,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17618 to 16630. [2025-04-13 17:35:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16630 states, 16613 states have (on average 3.0694034792030336) internal successors, (50992), 16629 states have internal predecessors, (50992), 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-04-13 17:35:04,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16630 states to 16630 states and 50992 transitions. [2025-04-13 17:35:05,488 INFO L79 Accepts]: Start accepts. Automaton has 16630 states and 50992 transitions. Word has length 40 [2025-04-13 17:35:05,488 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:05,488 INFO L485 AbstractCegarLoop]: Abstraction has 16630 states and 50992 transitions. [2025-04-13 17:35:05,488 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:35:05,488 INFO L278 IsEmpty]: Start isEmpty. Operand 16630 states and 50992 transitions. [2025-04-13 17:35:05,493 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:35:05,493 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:05,493 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:05,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2025-04-13 17:35:05,493 INFO L403 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:35:05,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:05,493 INFO L85 PathProgramCache]: Analyzing trace with hash -816267371, now seen corresponding path program 37 times [2025-04-13 17:35:05,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:05,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950091753] [2025-04-13 17:35:05,494 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:35:05,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:05,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-13 17:35:05,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:35:05,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:35:05,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:07,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:35:07,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:07,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950091753] [2025-04-13 17:35:07,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950091753] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:35:07,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:35:07,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:35:07,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395323596] [2025-04-13 17:35:07,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:35:07,501 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:35:07,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:07,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:35:07,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:35:07,502 INFO L87 Difference]: Start difference. First operand 16630 states and 50992 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:35:11,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:11,323 INFO L93 Difference]: Finished difference Result 30915 states and 94611 transitions. [2025-04-13 17:35:11,323 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:35:11,324 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:35:11,324 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:11,859 INFO L225 Difference]: With dead ends: 30915 [2025-04-13 17:35:11,859 INFO L226 Difference]: Without dead ends: 17710 [2025-04-13 17:35:11,887 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:35:11,888 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4076 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 4076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:11,888 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 4118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 4076 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-04-13 17:35:11,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17710 states. [2025-04-13 17:35:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17710 to 16570. [2025-04-13 17:35:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16570 states, 16553 states have (on average 3.0682655711955538) internal successors, (50789), 16569 states have internal predecessors, (50789), 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-04-13 17:35:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16570 states to 16570 states and 50789 transitions. [2025-04-13 17:35:12,675 INFO L79 Accepts]: Start accepts. Automaton has 16570 states and 50789 transitions. Word has length 40 [2025-04-13 17:35:12,675 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:12,675 INFO L485 AbstractCegarLoop]: Abstraction has 16570 states and 50789 transitions. [2025-04-13 17:35:12,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:35:12,675 INFO L278 IsEmpty]: Start isEmpty. Operand 16570 states and 50789 transitions. [2025-04-13 17:35:12,680 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:35:12,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:12,680 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:12,680 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-04-13 17:35:12,680 INFO L403 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:35:12,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:12,680 INFO L85 PathProgramCache]: Analyzing trace with hash 382778105, now seen corresponding path program 38 times [2025-04-13 17:35:12,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:12,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700383788] [2025-04-13 17:35:12,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:35:12,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:12,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:35:12,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:35:12,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:35:12,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:14,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:35:14,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:14,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700383788] [2025-04-13 17:35:14,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700383788] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:35:14,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:35:14,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:35:14,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136171901] [2025-04-13 17:35:14,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:35:14,288 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:35:14,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:14,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:35:14,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:35:14,289 INFO L87 Difference]: Start difference. First operand 16570 states and 50789 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:35:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:18,476 INFO L93 Difference]: Finished difference Result 30613 states and 93676 transitions. [2025-04-13 17:35:18,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:35:18,477 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:35:18,477 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:19,022 INFO L225 Difference]: With dead ends: 30613 [2025-04-13 17:35:19,022 INFO L226 Difference]: Without dead ends: 17652 [2025-04-13 17:35:19,051 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:35:19,051 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 206 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4503 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 4503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:19,051 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 0 Invalid, 4546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 4503 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-04-13 17:35:19,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17652 states. [2025-04-13 17:35:19,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17652 to 16564. [2025-04-13 17:35:19,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16564 states, 16547 states have (on average 3.068411192361153) internal successors, (50773), 16563 states have internal predecessors, (50773), 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-04-13 17:35:19,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16564 states to 16564 states and 50773 transitions. [2025-04-13 17:35:19,838 INFO L79 Accepts]: Start accepts. Automaton has 16564 states and 50773 transitions. Word has length 40 [2025-04-13 17:35:19,838 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:19,838 INFO L485 AbstractCegarLoop]: Abstraction has 16564 states and 50773 transitions. [2025-04-13 17:35:19,838 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:35:19,838 INFO L278 IsEmpty]: Start isEmpty. Operand 16564 states and 50773 transitions. [2025-04-13 17:35:19,843 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:35:19,843 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:19,843 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:19,843 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-04-13 17:35:19,843 INFO L403 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:35:19,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:19,843 INFO L85 PathProgramCache]: Analyzing trace with hash 48788801, now seen corresponding path program 39 times [2025-04-13 17:35:19,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:19,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201297780] [2025-04-13 17:35:19,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:35:19,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:19,875 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-04-13 17:35:19,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 36 of 40 statements. [2025-04-13 17:35:19,898 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:35:19,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:35:22,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:22,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201297780] [2025-04-13 17:35:22,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201297780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:35:22,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:35:22,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-04-13 17:35:22,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298064782] [2025-04-13 17:35:22,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:35:22,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:35:22,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:22,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:35:22,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:35:22,219 INFO L87 Difference]: Start difference. First operand 16564 states and 50773 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:35:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:26,550 INFO L93 Difference]: Finished difference Result 30541 states and 93483 transitions. [2025-04-13 17:35:26,550 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:35:26,550 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 40 [2025-04-13 17:35:26,550 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:27,251 INFO L225 Difference]: With dead ends: 30541 [2025-04-13 17:35:27,251 INFO L226 Difference]: Without dead ends: 17584 [2025-04-13 17:35:27,274 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:35:27,274 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 196 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4753 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 4753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:27,274 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 0 Invalid, 4794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 4753 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-04-13 17:35:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17584 states. [2025-04-13 17:35:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17584 to 16540. [2025-04-13 17:35:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16540 states, 16523 states have (on average 3.0689947346123585) internal successors, (50709), 16539 states have internal predecessors, (50709), 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-04-13 17:35:27,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16540 states to 16540 states and 50709 transitions. [2025-04-13 17:35:28,061 INFO L79 Accepts]: Start accepts. Automaton has 16540 states and 50709 transitions. Word has length 40 [2025-04-13 17:35:28,062 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:28,062 INFO L485 AbstractCegarLoop]: Abstraction has 16540 states and 50709 transitions. [2025-04-13 17:35:28,062 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-04-13 17:35:28,062 INFO L278 IsEmpty]: Start isEmpty. Operand 16540 states and 50709 transitions. [2025-04-13 17:35:28,066 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 17:35:28,066 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:28,066 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:28,066 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2025-04-13 17:35:28,066 INFO L403 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:35:28,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:28,066 INFO L85 PathProgramCache]: Analyzing trace with hash 872775327, now seen corresponding path program 40 times [2025-04-13 17:35:28,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:28,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452572186] [2025-04-13 17:35:28,067 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:35:28,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:28,099 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 17:35:28,125 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 17:35:28,125 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:35:28,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:35:30,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:30,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452572186] [2025-04-13 17:35:30,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452572186] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:35:30,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:35:30,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-04-13 17:35:30,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827305304] [2025-04-13 17:35:30,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:35:30,936 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:35:30,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:30,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:35:30,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:35:30,936 INFO L87 Difference]: Start difference. First operand 16540 states and 50709 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:35:34,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:34,482 INFO L93 Difference]: Finished difference Result 30309 states and 92803 transitions. [2025-04-13 17:35:34,482 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:35:34,482 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 40 [2025-04-13 17:35:34,482 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:35,038 INFO L225 Difference]: With dead ends: 30309 [2025-04-13 17:35:35,038 INFO L226 Difference]: Without dead ends: 17176 [2025-04-13 17:35:35,065 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:35:35,066 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 177 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3847 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:35,066 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 0 Invalid, 3884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3847 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 17:35:35,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17176 states. [2025-04-13 17:35:35,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17176 to 16422. [2025-04-13 17:35:35,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16422 states, 16405 states have (on average 3.069003352636391) internal successors, (50347), 16421 states have internal predecessors, (50347), 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-04-13 17:35:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16422 states to 16422 states and 50347 transitions. [2025-04-13 17:35:36,123 INFO L79 Accepts]: Start accepts. Automaton has 16422 states and 50347 transitions. Word has length 40 [2025-04-13 17:35:36,123 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:36,123 INFO L485 AbstractCegarLoop]: Abstraction has 16422 states and 50347 transitions. [2025-04-13 17:35:36,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-04-13 17:35:36,123 INFO L278 IsEmpty]: Start isEmpty. Operand 16422 states and 50347 transitions. [2025-04-13 17:35:36,128 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 17:35:36,128 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:36,128 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:36,128 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2025-04-13 17:35:36,128 INFO L403 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:35:36,128 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:36,129 INFO L85 PathProgramCache]: Analyzing trace with hash 511929453, now seen corresponding path program 1 times [2025-04-13 17:35:36,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:36,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912424287] [2025-04-13 17:35:36,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:35:36,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:36,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 17:35:36,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 17:35:36,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:35:36,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:35:39,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:39,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912424287] [2025-04-13 17:35:39,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912424287] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:35:39,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:35:39,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-04-13 17:35:39,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751067702] [2025-04-13 17:35:39,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:35:39,555 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:35:39,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:39,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:35:39,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:35:39,555 INFO L87 Difference]: Start difference. First operand 16422 states and 50347 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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-04-13 17:35:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:44,454 INFO L93 Difference]: Finished difference Result 29784 states and 91035 transitions. [2025-04-13 17:35:44,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 17:35:44,455 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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 41 [2025-04-13 17:35:44,455 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:45,081 INFO L225 Difference]: With dead ends: 29784 [2025-04-13 17:35:45,082 INFO L226 Difference]: Without dead ends: 16762 [2025-04-13 17:35:45,105 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=194, Invalid=1698, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 17:35:45,106 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 206 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5233 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 5233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:45,106 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 0 Invalid, 5290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 5233 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-04-13 17:35:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16762 states. [2025-04-13 17:35:45,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16762 to 16678. [2025-04-13 17:35:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16678 states, 16661 states have (on average 3.066862733329332) internal successors, (51097), 16677 states have internal predecessors, (51097), 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-04-13 17:35:45,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16678 states to 16678 states and 51097 transitions. [2025-04-13 17:35:45,901 INFO L79 Accepts]: Start accepts. Automaton has 16678 states and 51097 transitions. Word has length 41 [2025-04-13 17:35:45,901 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:45,901 INFO L485 AbstractCegarLoop]: Abstraction has 16678 states and 51097 transitions. [2025-04-13 17:35:45,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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-04-13 17:35:45,901 INFO L278 IsEmpty]: Start isEmpty. Operand 16678 states and 51097 transitions. [2025-04-13 17:35:45,906 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 17:35:45,906 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:45,906 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:45,906 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2025-04-13 17:35:45,906 INFO L403 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:35:45,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:45,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1233678089, now seen corresponding path program 2 times [2025-04-13 17:35:45,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:45,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065130616] [2025-04-13 17:35:45,906 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:35:45,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:45,939 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 17:35:45,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 41 statements. [2025-04-13 17:35:45,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:35:45,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:35:49,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:49,063 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065130616] [2025-04-13 17:35:49,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065130616] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:35:49,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:35:49,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-04-13 17:35:49,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661740888] [2025-04-13 17:35:49,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:35:49,063 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:35:49,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:49,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:35:49,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:35:49,064 INFO L87 Difference]: Start difference. First operand 16678 states and 51097 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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-04-13 17:35:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:35:55,304 INFO L93 Difference]: Finished difference Result 29850 states and 91331 transitions. [2025-04-13 17:35:55,304 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 17:35:55,304 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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 41 [2025-04-13 17:35:55,304 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:35:55,890 INFO L225 Difference]: With dead ends: 29850 [2025-04-13 17:35:55,890 INFO L226 Difference]: Without dead ends: 17050 [2025-04-13 17:35:55,916 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=274, Invalid=1982, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 17:35:55,916 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 217 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6428 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 6428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:35:55,916 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 0 Invalid, 6520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 6428 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-04-13 17:35:55,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17050 states. [2025-04-13 17:35:56,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17050 to 16692. [2025-04-13 17:35:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16692 states, 16675 states have (on average 3.0678260869565217) internal successors, (51156), 16691 states have internal predecessors, (51156), 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-04-13 17:35:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16692 states to 16692 states and 51156 transitions. [2025-04-13 17:35:56,729 INFO L79 Accepts]: Start accepts. Automaton has 16692 states and 51156 transitions. Word has length 41 [2025-04-13 17:35:56,730 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:35:56,730 INFO L485 AbstractCegarLoop]: Abstraction has 16692 states and 51156 transitions. [2025-04-13 17:35:56,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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-04-13 17:35:56,730 INFO L278 IsEmpty]: Start isEmpty. Operand 16692 states and 51156 transitions. [2025-04-13 17:35:56,734 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 17:35:56,734 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:35:56,734 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:35:56,734 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2025-04-13 17:35:56,734 INFO L403 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:35:56,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:35:56,735 INFO L85 PathProgramCache]: Analyzing trace with hash -425110187, now seen corresponding path program 3 times [2025-04-13 17:35:56,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:35:56,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267129121] [2025-04-13 17:35:56,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:35:56,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:35:56,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 3 equivalence classes. [2025-04-13 17:35:56,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 37 of 41 statements. [2025-04-13 17:35:56,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:35:56,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:35:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:35:59,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:35:59,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267129121] [2025-04-13 17:35:59,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267129121] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:35:59,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:35:59,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-04-13 17:35:59,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008733363] [2025-04-13 17:35:59,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:35:59,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:35:59,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:35:59,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:35:59,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:35:59,835 INFO L87 Difference]: Start difference. First operand 16692 states and 51156 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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-04-13 17:36:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:06,670 INFO L93 Difference]: Finished difference Result 30182 states and 92214 transitions. [2025-04-13 17:36:06,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 17:36:06,670 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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 41 [2025-04-13 17:36:06,670 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:07,236 INFO L225 Difference]: With dead ends: 30182 [2025-04-13 17:36:07,236 INFO L226 Difference]: Without dead ends: 17328 [2025-04-13 17:36:07,263 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=315, Invalid=2441, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 17:36:07,264 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6701 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 6701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:07,264 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 6791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 6701 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-04-13 17:36:07,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17328 states. [2025-04-13 17:36:07,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17328 to 16793. [2025-04-13 17:36:07,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16793 states, 16776 states have (on average 3.0663447782546496) internal successors, (51441), 16792 states have internal predecessors, (51441), 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-04-13 17:36:07,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16793 states to 16793 states and 51441 transitions. [2025-04-13 17:36:08,100 INFO L79 Accepts]: Start accepts. Automaton has 16793 states and 51441 transitions. Word has length 41 [2025-04-13 17:36:08,100 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:08,100 INFO L485 AbstractCegarLoop]: Abstraction has 16793 states and 51441 transitions. [2025-04-13 17:36:08,100 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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-04-13 17:36:08,100 INFO L278 IsEmpty]: Start isEmpty. Operand 16793 states and 51441 transitions. [2025-04-13 17:36:08,105 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 17:36:08,105 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:08,105 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:08,105 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2025-04-13 17:36:08,105 INFO L403 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:36:08,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:08,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1282393807, now seen corresponding path program 4 times [2025-04-13 17:36:08,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:08,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788809758] [2025-04-13 17:36:08,105 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:36:08,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:08,138 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-13 17:36:08,164 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 17:36:08,164 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:36:08,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:36:11,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:11,833 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788809758] [2025-04-13 17:36:11,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788809758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:36:11,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:36:11,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-04-13 17:36:11,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630750285] [2025-04-13 17:36:11,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:36:11,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 17:36:11,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:11,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 17:36:11,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:36:11,834 INFO L87 Difference]: Start difference. First operand 16793 states and 51441 transitions. Second operand has 24 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 23 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-04-13 17:36:18,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:18,841 INFO L93 Difference]: Finished difference Result 29502 states and 90006 transitions. [2025-04-13 17:36:18,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 17:36:18,842 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 23 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 41 [2025-04-13 17:36:18,842 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:19,559 INFO L225 Difference]: With dead ends: 29502 [2025-04-13 17:36:19,559 INFO L226 Difference]: Without dead ends: 17302 [2025-04-13 17:36:19,605 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=208, Invalid=2048, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 17:36:19,606 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 213 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7352 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 7352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:19,606 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 0 Invalid, 7407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 7352 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-04-13 17:36:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17302 states. [2025-04-13 17:36:19,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17302 to 16903. [2025-04-13 17:36:19,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16903 states, 16886 states have (on average 3.068103754589601) internal successors, (51808), 16902 states have internal predecessors, (51808), 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-04-13 17:36:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16903 states to 16903 states and 51808 transitions. [2025-04-13 17:36:20,468 INFO L79 Accepts]: Start accepts. Automaton has 16903 states and 51808 transitions. Word has length 41 [2025-04-13 17:36:20,469 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:20,469 INFO L485 AbstractCegarLoop]: Abstraction has 16903 states and 51808 transitions. [2025-04-13 17:36:20,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 23 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-04-13 17:36:20,469 INFO L278 IsEmpty]: Start isEmpty. Operand 16903 states and 51808 transitions. [2025-04-13 17:36:20,473 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 17:36:20,474 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:20,474 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:20,474 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2025-04-13 17:36:20,474 INFO L403 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:36:20,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:20,474 INFO L85 PathProgramCache]: Analyzing trace with hash 482753467, now seen corresponding path program 5 times [2025-04-13 17:36:20,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:20,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152546755] [2025-04-13 17:36:20,474 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:36:20,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:20,508 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 3 equivalence classes. [2025-04-13 17:36:20,522 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 17:36:20,523 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:36:20,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:23,861 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:36:23,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:23,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152546755] [2025-04-13 17:36:23,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152546755] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:36:23,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:36:23,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-04-13 17:36:23,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167912107] [2025-04-13 17:36:23,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:36:23,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:36:23,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:23,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:36:23,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:36:23,862 INFO L87 Difference]: Start difference. First operand 16903 states and 51808 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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-04-13 17:36:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:30,733 INFO L93 Difference]: Finished difference Result 30363 states and 92894 transitions. [2025-04-13 17:36:30,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 17:36:30,733 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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 41 [2025-04-13 17:36:30,733 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:31,330 INFO L225 Difference]: With dead ends: 30363 [2025-04-13 17:36:31,330 INFO L226 Difference]: Without dead ends: 17659 [2025-04-13 17:36:31,374 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=334, Invalid=2972, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 17:36:31,375 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 259 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6653 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 6653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:31,375 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 0 Invalid, 6770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 6653 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-04-13 17:36:31,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17659 states. [2025-04-13 17:36:31,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17659 to 17119. [2025-04-13 17:36:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17119 states, 17102 states have (on average 3.070050286516197) internal successors, (52504), 17118 states have internal predecessors, (52504), 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-04-13 17:36:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17119 states to 17119 states and 52504 transitions. [2025-04-13 17:36:32,264 INFO L79 Accepts]: Start accepts. Automaton has 17119 states and 52504 transitions. Word has length 41 [2025-04-13 17:36:32,264 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:32,264 INFO L485 AbstractCegarLoop]: Abstraction has 17119 states and 52504 transitions. [2025-04-13 17:36:32,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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-04-13 17:36:32,264 INFO L278 IsEmpty]: Start isEmpty. Operand 17119 states and 52504 transitions. [2025-04-13 17:36:32,269 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 17:36:32,269 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:32,270 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:32,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2025-04-13 17:36:32,270 INFO L403 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:36:32,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:32,270 INFO L85 PathProgramCache]: Analyzing trace with hash -183313937, now seen corresponding path program 6 times [2025-04-13 17:36:32,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:32,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057771904] [2025-04-13 17:36:32,270 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:36:32,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:32,304 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 3 equivalence classes. [2025-04-13 17:36:32,319 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 37 of 41 statements. [2025-04-13 17:36:32,319 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:36:32,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:35,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:36:35,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:35,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057771904] [2025-04-13 17:36:35,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057771904] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:36:35,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:36:35,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-04-13 17:36:35,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429479707] [2025-04-13 17:36:35,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:36:35,693 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 17:36:35,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:35,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 17:36:35,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:36:35,693 INFO L87 Difference]: Start difference. First operand 17119 states and 52504 transitions. Second operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 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-04-13 17:36:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:42,406 INFO L93 Difference]: Finished difference Result 29693 states and 90614 transitions. [2025-04-13 17:36:42,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 17:36:42,406 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 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 41 [2025-04-13 17:36:42,406 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:42,992 INFO L225 Difference]: With dead ends: 29693 [2025-04-13 17:36:42,993 INFO L226 Difference]: Without dead ends: 17553 [2025-04-13 17:36:43,020 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=220, Invalid=2036, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 17:36:43,020 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 175 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6967 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 6967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:43,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 0 Invalid, 7057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 6967 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2025-04-13 17:36:43,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17553 states. [2025-04-13 17:36:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17553 to 17243. [2025-04-13 17:36:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17243 states, 17226 states have (on average 3.0699523975386045) internal successors, (52883), 17242 states have internal predecessors, (52883), 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-04-13 17:36:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17243 states to 17243 states and 52883 transitions. [2025-04-13 17:36:43,893 INFO L79 Accepts]: Start accepts. Automaton has 17243 states and 52883 transitions. Word has length 41 [2025-04-13 17:36:43,893 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:43,893 INFO L485 AbstractCegarLoop]: Abstraction has 17243 states and 52883 transitions. [2025-04-13 17:36:43,893 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 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-04-13 17:36:43,893 INFO L278 IsEmpty]: Start isEmpty. Operand 17243 states and 52883 transitions. [2025-04-13 17:36:43,898 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 17:36:43,898 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:43,898 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:43,899 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2025-04-13 17:36:43,899 INFO L403 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:36:43,899 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:43,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1960339335, now seen corresponding path program 7 times [2025-04-13 17:36:43,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:43,899 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759554365] [2025-04-13 17:36:43,899 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:36:43,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:43,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 17:36:43,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 17:36:43,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:36:43,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:36:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:36:47,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:36:47,322 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759554365] [2025-04-13 17:36:47,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759554365] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:36:47,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:36:47,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-04-13 17:36:47,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083957892] [2025-04-13 17:36:47,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:36:47,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 17:36:47,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:36:47,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 17:36:47,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:36:47,323 INFO L87 Difference]: Start difference. First operand 17243 states and 52883 transitions. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-04-13 17:36:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:36:55,305 INFO L93 Difference]: Finished difference Result 31055 states and 95085 transitions. [2025-04-13 17:36:55,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 17:36:55,305 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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 41 [2025-04-13 17:36:55,305 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:36:55,921 INFO L225 Difference]: With dead ends: 31055 [2025-04-13 17:36:55,922 INFO L226 Difference]: Without dead ends: 18351 [2025-04-13 17:36:55,953 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=370, Invalid=3170, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 17:36:55,954 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 257 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7765 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 7765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:36:55,954 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 0 Invalid, 7886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 7765 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2025-04-13 17:36:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18351 states. [2025-04-13 17:36:56,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18351 to 17327. [2025-04-13 17:36:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17327 states, 17310 states have (on average 3.070421721548238) internal successors, (53149), 17326 states have internal predecessors, (53149), 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-04-13 17:36:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17327 states to 17327 states and 53149 transitions. [2025-04-13 17:36:56,837 INFO L79 Accepts]: Start accepts. Automaton has 17327 states and 53149 transitions. Word has length 41 [2025-04-13 17:36:56,838 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:36:56,838 INFO L485 AbstractCegarLoop]: Abstraction has 17327 states and 53149 transitions. [2025-04-13 17:36:56,838 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-04-13 17:36:56,838 INFO L278 IsEmpty]: Start isEmpty. Operand 17327 states and 53149 transitions. [2025-04-13 17:36:56,843 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 17:36:56,843 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:36:56,844 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:36:56,844 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2025-04-13 17:36:56,844 INFO L403 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:36:56,844 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:36:56,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1458243927, now seen corresponding path program 8 times [2025-04-13 17:36:56,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:36:56,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322229407] [2025-04-13 17:36:56,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:36:56,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:36:56,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 17:36:56,896 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 37 of 41 statements. [2025-04-13 17:36:56,896 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:36:56,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:00,093 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:37:00,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:37:00,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322229407] [2025-04-13 17:37:00,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322229407] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:37:00,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:37:00,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-04-13 17:37:00,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070410311] [2025-04-13 17:37:00,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:37:00,094 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 17:37:00,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:37:00,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 17:37:00,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:37:00,094 INFO L87 Difference]: Start difference. First operand 17327 states and 53149 transitions. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-04-13 17:37:07,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:37:07,148 INFO L93 Difference]: Finished difference Result 30015 states and 91570 transitions. [2025-04-13 17:37:07,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 17:37:07,148 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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 41 [2025-04-13 17:37:07,148 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:37:07,752 INFO L225 Difference]: With dead ends: 30015 [2025-04-13 17:37:07,752 INFO L226 Difference]: Without dead ends: 17875 [2025-04-13 17:37:07,778 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 627 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=344, Invalid=2848, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 17:37:07,779 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6935 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 6935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:37:07,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 7055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 6935 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-04-13 17:37:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17875 states. [2025-04-13 17:37:07,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17875 to 17347. [2025-04-13 17:37:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17347 states, 17330 states have (on average 3.0723023658395845) internal successors, (53243), 17346 states have internal predecessors, (53243), 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-04-13 17:37:08,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17347 states to 17347 states and 53243 transitions. [2025-04-13 17:37:08,636 INFO L79 Accepts]: Start accepts. Automaton has 17347 states and 53243 transitions. Word has length 41 [2025-04-13 17:37:08,636 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:37:08,636 INFO L485 AbstractCegarLoop]: Abstraction has 17347 states and 53243 transitions. [2025-04-13 17:37:08,637 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-04-13 17:37:08,637 INFO L278 IsEmpty]: Start isEmpty. Operand 17347 states and 53243 transitions. [2025-04-13 17:37:08,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 17:37:08,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:37:08,642 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:37:08,642 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2025-04-13 17:37:08,642 INFO L403 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:37:08,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:37:08,643 INFO L85 PathProgramCache]: Analyzing trace with hash -979092303, now seen corresponding path program 9 times [2025-04-13 17:37:08,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:37:08,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242573603] [2025-04-13 17:37:08,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:37:08,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:37:08,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 3 equivalence classes. [2025-04-13 17:37:08,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 37 of 41 statements. [2025-04-13 17:37:08,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:37:08,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:37:12,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:37:12,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242573603] [2025-04-13 17:37:12,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242573603] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:37:12,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:37:12,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-04-13 17:37:12,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987626030] [2025-04-13 17:37:12,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:37:12,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 17:37:12,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:37:12,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 17:37:12,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:37:12,372 INFO L87 Difference]: Start difference. First operand 17347 states and 53243 transitions. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-04-13 17:37:19,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:37:19,198 INFO L93 Difference]: Finished difference Result 30457 states and 93179 transitions. [2025-04-13 17:37:19,198 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 17:37:19,198 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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 41 [2025-04-13 17:37:19,198 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:37:19,806 INFO L225 Difference]: With dead ends: 30457 [2025-04-13 17:37:19,806 INFO L226 Difference]: Without dead ends: 17819 [2025-04-13 17:37:19,832 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=218, Invalid=2038, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 17:37:19,833 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 147 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7069 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 7138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 7069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:37:19,833 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 0 Invalid, 7138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 7069 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-04-13 17:37:19,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17819 states. [2025-04-13 17:37:20,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17819 to 17451. [2025-04-13 17:37:20,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17451 states, 17434 states have (on average 3.07324767695308) internal successors, (53579), 17450 states have internal predecessors, (53579), 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-04-13 17:37:20,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17451 states to 17451 states and 53579 transitions. [2025-04-13 17:37:20,770 INFO L79 Accepts]: Start accepts. Automaton has 17451 states and 53579 transitions. Word has length 41 [2025-04-13 17:37:20,770 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:37:20,770 INFO L485 AbstractCegarLoop]: Abstraction has 17451 states and 53579 transitions. [2025-04-13 17:37:20,770 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-04-13 17:37:20,770 INFO L278 IsEmpty]: Start isEmpty. Operand 17451 states and 53579 transitions. [2025-04-13 17:37:20,776 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 17:37:20,776 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:37:20,776 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:37:20,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2025-04-13 17:37:20,776 INFO L403 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:37:20,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:37:20,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1607954309, now seen corresponding path program 10 times [2025-04-13 17:37:20,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:37:20,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674145894] [2025-04-13 17:37:20,777 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:37:20,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:37:20,809 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-04-13 17:37:20,838 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 17:37:20,838 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:37:20,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:37:24,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:37:24,112 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674145894] [2025-04-13 17:37:24,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674145894] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:37:24,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:37:24,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-04-13 17:37:24,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051667630] [2025-04-13 17:37:24,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:37:24,113 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 17:37:24,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:37:24,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 17:37:24,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:37:24,113 INFO L87 Difference]: Start difference. First operand 17451 states and 53579 transitions. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-04-13 17:37:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:37:31,191 INFO L93 Difference]: Finished difference Result 31268 states and 95718 transitions. [2025-04-13 17:37:31,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 17:37:31,191 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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 41 [2025-04-13 17:37:31,191 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:37:31,792 INFO L225 Difference]: With dead ends: 31268 [2025-04-13 17:37:31,792 INFO L226 Difference]: Without dead ends: 18438 [2025-04-13 17:37:31,818 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=337, Invalid=2969, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 17:37:31,819 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 248 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6838 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 6838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:37:31,819 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 0 Invalid, 6937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 6838 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-04-13 17:37:31,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18438 states. [2025-04-13 17:37:32,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18438 to 17669. [2025-04-13 17:37:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17669 states, 17652 states have (on average 3.0679243145252664) internal successors, (54155), 17668 states have internal predecessors, (54155), 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-04-13 17:37:32,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17669 states to 17669 states and 54155 transitions. [2025-04-13 17:37:32,713 INFO L79 Accepts]: Start accepts. Automaton has 17669 states and 54155 transitions. Word has length 41 [2025-04-13 17:37:32,714 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:37:32,714 INFO L485 AbstractCegarLoop]: Abstraction has 17669 states and 54155 transitions. [2025-04-13 17:37:32,714 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-04-13 17:37:32,714 INFO L278 IsEmpty]: Start isEmpty. Operand 17669 states and 54155 transitions. [2025-04-13 17:37:32,720 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 17:37:32,720 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:37:32,720 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:37:32,720 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2025-04-13 17:37:32,720 INFO L403 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:37:32,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:37:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1363329713, now seen corresponding path program 11 times [2025-04-13 17:37:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:37:32,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068255447] [2025-04-13 17:37:32,721 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:37:32,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:37:32,754 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 41 statements into 3 equivalence classes. [2025-04-13 17:37:32,773 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 17:37:32,774 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:37:32,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:36,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:37:36,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:37:36,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068255447] [2025-04-13 17:37:36,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068255447] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:37:36,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:37:36,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-04-13 17:37:36,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509578760] [2025-04-13 17:37:36,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:37:36,198 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:37:36,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:37:36,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:37:36,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:37:36,198 INFO L87 Difference]: Start difference. First operand 17669 states and 54155 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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-04-13 17:37:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:37:41,840 INFO L93 Difference]: Finished difference Result 30261 states and 92307 transitions. [2025-04-13 17:37:41,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 17:37:41,840 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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 41 [2025-04-13 17:37:41,841 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:37:42,474 INFO L225 Difference]: With dead ends: 30261 [2025-04-13 17:37:42,474 INFO L226 Difference]: Without dead ends: 18121 [2025-04-13 17:37:42,499 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=196, Invalid=1610, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:37:42,499 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 141 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6231 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 6291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 6231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:37:42,500 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 0 Invalid, 6291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 6231 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-04-13 17:37:42,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18121 states. [2025-04-13 17:37:42,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18121 to 17685. [2025-04-13 17:37:42,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17685 states, 17668 states have (on average 3.06741000679194) internal successors, (54195), 17684 states have internal predecessors, (54195), 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-04-13 17:37:42,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17685 states to 17685 states and 54195 transitions. [2025-04-13 17:37:43,386 INFO L79 Accepts]: Start accepts. Automaton has 17685 states and 54195 transitions. Word has length 41 [2025-04-13 17:37:43,386 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:37:43,386 INFO L485 AbstractCegarLoop]: Abstraction has 17685 states and 54195 transitions. [2025-04-13 17:37:43,386 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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-04-13 17:37:43,386 INFO L278 IsEmpty]: Start isEmpty. Operand 17685 states and 54195 transitions. [2025-04-13 17:37:43,392 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 17:37:43,392 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:37:43,392 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:37:43,392 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2025-04-13 17:37:43,393 INFO L403 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:37:43,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:37:43,393 INFO L85 PathProgramCache]: Analyzing trace with hash 793923801, now seen corresponding path program 12 times [2025-04-13 17:37:43,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:37:43,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303903533] [2025-04-13 17:37:43,393 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:37:43,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:37:43,427 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 3 equivalence classes. [2025-04-13 17:37:43,440 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 37 of 41 statements. [2025-04-13 17:37:43,440 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:37:43,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:46,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:37:46,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:37:46,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303903533] [2025-04-13 17:37:46,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303903533] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:37:46,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:37:46,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-04-13 17:37:46,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200619560] [2025-04-13 17:37:46,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:37:46,563 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:37:46,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:37:46,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:37:46,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:37:46,563 INFO L87 Difference]: Start difference. First operand 17685 states and 54195 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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-04-13 17:37:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:37:52,126 INFO L93 Difference]: Finished difference Result 30935 states and 94684 transitions. [2025-04-13 17:37:52,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 17:37:52,126 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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 41 [2025-04-13 17:37:52,126 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:37:52,792 INFO L225 Difference]: With dead ends: 30935 [2025-04-13 17:37:52,793 INFO L226 Difference]: Without dead ends: 18231 [2025-04-13 17:37:52,812 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=189, Invalid=1451, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 17:37:52,813 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 153 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5904 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 5904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:37:52,813 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 0 Invalid, 5993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 5904 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-04-13 17:37:52,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18231 states. [2025-04-13 17:37:53,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18231 to 17739. [2025-04-13 17:37:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17739 states, 17722 states have (on average 3.0700823834781628) internal successors, (54408), 17738 states have internal predecessors, (54408), 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-04-13 17:37:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17739 states to 17739 states and 54408 transitions. [2025-04-13 17:37:53,682 INFO L79 Accepts]: Start accepts. Automaton has 17739 states and 54408 transitions. Word has length 41 [2025-04-13 17:37:53,683 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:37:53,683 INFO L485 AbstractCegarLoop]: Abstraction has 17739 states and 54408 transitions. [2025-04-13 17:37:53,683 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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-04-13 17:37:53,683 INFO L278 IsEmpty]: Start isEmpty. Operand 17739 states and 54408 transitions. [2025-04-13 17:37:53,689 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 17:37:53,689 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:37:53,689 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:37:53,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2025-04-13 17:37:53,689 INFO L403 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2025-04-13 17:37:53,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:37:53,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1992191719, now seen corresponding path program 13 times [2025-04-13 17:37:53,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:37:53,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811434398] [2025-04-13 17:37:53,689 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:37:53,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:37:53,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-13 17:37:53,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 17:37:53,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:37:53,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:37:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:37:57,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:37:57,089 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811434398] [2025-04-13 17:37:57,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811434398] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:37:57,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:37:57,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-04-13 17:37:57,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943775872] [2025-04-13 17:37:57,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:37:57,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:37:57,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:37:57,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:37:57,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:37:57,090 INFO L87 Difference]: Start difference. First operand 17739 states and 54408 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 20 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) Received shutdown request... [2025-04-13 17:38:02,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 17:38:02,041 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=268, Invalid=2282, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 17:38:02,041 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 204 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5047 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 5125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 5047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:38:02,041 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 0 Invalid, 5125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 5047 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-04-13 17:38:02,041 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 17:38:02,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2025-04-13 17:38:02,041 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (17739states) and FLOYD_HOARE automaton (currently 40 states, 21 states before enhancement),while ReachableStatesComputation was computing reachable states (20060 states constructed, input type IntersectNwa). [2025-04-13 17:38:02,041 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 17:38:02,041 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2025-04-13 17:38:02,041 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 17:38:02,041 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 17:38:02,041 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-04-13 17:38:02,042 INFO L422 BasicCegarLoop]: Path program histogram: [43, 40, 13, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-13 17:38:02,043 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-04-13 17:38:02,043 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:38:02,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:38:02 BasicIcfg [2025-04-13 17:38:02,045 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:38:02,046 INFO L158 Benchmark]: Toolchain (without parser) took 788354.18ms. Allocated memory was 142.6MB in the beginning and 6.2GB in the end (delta: 6.1GB). Free memory was 94.6MB in the beginning and 3.3GB in the end (delta: -3.2GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2025-04-13 17:38:02,046 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:38:02,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 846.35ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 31.3MB in the end (delta: 63.4MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. [2025-04-13 17:38:02,046 INFO L158 Benchmark]: Boogie Procedure Inliner took 152.56ms. Allocated memory is still 142.6MB. Free memory was 30.3MB in the beginning and 90.5MB in the end (delta: -60.2MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. [2025-04-13 17:38:02,046 INFO L158 Benchmark]: Boogie Preprocessor took 163.50ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 76.0MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 17:38:02,046 INFO L158 Benchmark]: RCFGBuilder took 3220.52ms. Allocated memory was 142.6MB in the beginning and 348.1MB in the end (delta: 205.5MB). Free memory was 76.0MB in the beginning and 121.2MB in the end (delta: -45.2MB). Peak memory consumption was 223.4MB. Max. memory is 8.0GB. [2025-04-13 17:38:02,046 INFO L158 Benchmark]: TraceAbstraction took 783965.77ms. Allocated memory was 348.1MB in the beginning and 6.2GB in the end (delta: 5.9GB). Free memory was 121.2MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2025-04-13 17:38:02,046 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 846.35ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 31.3MB in the end (delta: 63.4MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 152.56ms. Allocated memory is still 142.6MB. Free memory was 30.3MB in the beginning and 90.5MB in the end (delta: -60.2MB). Peak memory consumption was 17.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 163.50ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 76.0MB in the end (delta: 14.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * RCFGBuilder took 3220.52ms. Allocated memory was 142.6MB in the beginning and 348.1MB in the end (delta: 205.5MB). Free memory was 76.0MB in the beginning and 121.2MB in the end (delta: -45.2MB). Peak memory consumption was 223.4MB. Max. memory is 8.0GB. * TraceAbstraction took 783965.77ms. Allocated memory was 348.1MB in the beginning and 6.2GB in the end (delta: 5.9GB). Free memory was 121.2MB in the beginning and 3.3GB in the end (delta: -3.1GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1900]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (17739states) and FLOYD_HOARE automaton (currently 40 states, 21 states before enhancement),while ReachableStatesComputation was computing reachable states (20060 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1793]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (17739states) and FLOYD_HOARE automaton (currently 40 states, 21 states before enhancement),while ReachableStatesComputation was computing reachable states (20060 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1914]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (17739states) and FLOYD_HOARE automaton (currently 40 states, 21 states before enhancement),while ReachableStatesComputation was computing reachable states (20060 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1900]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (17739states) and FLOYD_HOARE automaton (currently 40 states, 21 states before enhancement),while ReachableStatesComputation was computing reachable states (20060 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1914]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (17739states) and FLOYD_HOARE automaton (currently 40 states, 21 states before enhancement),while ReachableStatesComputation was computing reachable states (20060 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1952]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (17739states) and FLOYD_HOARE automaton (currently 40 states, 21 states before enhancement),while ReachableStatesComputation was computing reachable states (20060 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 180 locations, 256 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 354 IncrementalHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 3 mSDtfsCounter, 354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2401occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 55 SizeOfPredicates, 0 NumberOfNonLiveVariables, 324 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 196 locations, 278 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 781.3s, OverallIterations: 107, TraceHistogramMax: 4, PathProgramHistogramMax: 43, EmptinessCheckTime: 0.7s, AutomataDifference: 478.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26213 SdHoareTripleChecker+Valid, 376.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26213 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 343.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 5479 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 464166 IncrementalHoareTripleChecker+Invalid, 469645 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5479 mSolverCounterUnsat, 3 mSDtfsCounter, 464166 mSolverCounterSat, 1.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3089 GetRequests, 296 SyntacticMatches, 20 SemanticMatches, 2773 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14849 ImplicationChecksByTransitivity, 41.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68718occurred in iteration=3, InterpolantAutomatonStates: 2302, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.3s AutomataMinimizationTime, 106 MinimizatonAttempts, 116972 StatesRemovedByMinimization, 105 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 213.6s InterpolantComputationTime, 4168 NumberOfCodeBlocks, 3968 NumberOfCodeBlocksAsserted, 154 NumberOfCheckSat, 4071 ConstructedInterpolants, 0 QuantifiedInterpolants, 72143 SizeOfPredicates, 0 NumberOfNonLiveVariables, 349 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 109 InterpolantComputations, 106 PerfectInterpolantSequences, 1040/1043 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown