./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/eureka_01-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/eureka_01-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc84672deb8568f357f3e53d1889a4a141611ae62422dd83eb7a6bc6f311a8b1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:36:54,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:36:54,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:36:54,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:36:54,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:36:54,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:36:54,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:36:54,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:36:54,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:36:54,250 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:36:54,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:36:54,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:36:54,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:36:54,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:36:54,251 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:36:54,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:36:54,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:36:54,251 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:36:54,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:36:54,252 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:36:54,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:36:54,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:36:54,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:36:54,253 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:36:54,253 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:36:54,253 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:36:54,253 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:36:54,253 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:36:54,253 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:36:54,253 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:36:54,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:36:54,253 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:36:54,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:36:54,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:36:54,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:36:54,253 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:36:54,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:36:54,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:36:54,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:36:54,254 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:36:54,254 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:36:54,254 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:36:54,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:36:54,254 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc84672deb8568f357f3e53d1889a4a141611ae62422dd83eb7a6bc6f311a8b1 [2025-03-08 04:36:54,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:36:54,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:36:54,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:36:54,492 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:36:54,492 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:36:54,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/eureka_01-2.c [2025-03-08 04:36:55,612 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e61e231/40e018e3498f4501bb4e04f05dd44ed7/FLAG965f66b9f [2025-03-08 04:36:55,779 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:36:55,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_01-2.c [2025-03-08 04:36:55,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e61e231/40e018e3498f4501bb4e04f05dd44ed7/FLAG965f66b9f [2025-03-08 04:36:55,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e61e231/40e018e3498f4501bb4e04f05dd44ed7 [2025-03-08 04:36:55,798 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:36:55,799 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:36:55,800 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:36:55,800 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:36:55,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:36:55,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:36:55" (1/1) ... [2025-03-08 04:36:55,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10f0d258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:55, skipping insertion in model container [2025-03-08 04:36:55,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:36:55" (1/1) ... [2025-03-08 04:36:55,814 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:36:55,922 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_01-2.c[323,336] [2025-03-08 04:36:55,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:36:55,963 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:36:55,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/eureka_01-2.c[323,336] [2025-03-08 04:36:55,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:36:56,004 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:36:56,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:56 WrapperNode [2025-03-08 04:36:56,006 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:36:56,007 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:36:56,007 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:36:56,007 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:36:56,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:56" (1/1) ... [2025-03-08 04:36:56,017 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:56" (1/1) ... [2025-03-08 04:36:56,040 INFO L138 Inliner]: procedures = 14, calls = 100, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 186 [2025-03-08 04:36:56,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:36:56,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:36:56,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:36:56,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:36:56,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:56" (1/1) ... [2025-03-08 04:36:56,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:56" (1/1) ... [2025-03-08 04:36:56,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:56" (1/1) ... [2025-03-08 04:36:56,061 INFO L175 MemorySlicer]: Split 81 memory accesses to 5 slices as follows [2, 23, 9, 24, 23]. 30 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 66 writes are split as follows [0, 21, 3, 21, 21]. [2025-03-08 04:36:56,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:56" (1/1) ... [2025-03-08 04:36:56,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:56" (1/1) ... [2025-03-08 04:36:56,068 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:56" (1/1) ... [2025-03-08 04:36:56,069 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:56" (1/1) ... [2025-03-08 04:36:56,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:56" (1/1) ... [2025-03-08 04:36:56,071 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:56" (1/1) ... [2025-03-08 04:36:56,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:36:56,073 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:36:56,073 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:36:56,073 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:36:56,074 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:56" (1/1) ... [2025-03-08 04:36:56,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:36:56,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:36:56,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 04:36:56,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 04:36:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:36:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:36:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:36:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 04:36:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 04:36:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 04:36:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-08 04:36:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-08 04:36:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-08 04:36:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-08 04:36:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-08 04:36:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 04:36:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:36:56,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:36:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 04:36:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 04:36:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 04:36:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:36:56,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:36:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:36:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:36:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 04:36:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 04:36:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 04:36:56,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:36:56,197 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:36:56,198 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:36:56,402 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: call ULTIMATE.dealloc(main_~#Source~0#1.base, main_~#Source~0#1.offset);havoc main_~#Source~0#1.base, main_~#Source~0#1.offset;call ULTIMATE.dealloc(main_~#Dest~0#1.base, main_~#Dest~0#1.offset);havoc main_~#Dest~0#1.base, main_~#Dest~0#1.offset;call ULTIMATE.dealloc(main_~#Weight~0#1.base, main_~#Weight~0#1.offset);havoc main_~#Weight~0#1.base, main_~#Weight~0#1.offset;call ULTIMATE.dealloc(main_~#distance~0#1.base, main_~#distance~0#1.offset);havoc main_~#distance~0#1.base, main_~#distance~0#1.offset; [2025-03-08 04:36:56,409 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 04:36:56,410 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:36:56,418 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:36:56,418 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:36:56,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:36:56 BoogieIcfgContainer [2025-03-08 04:36:56,418 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:36:56,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:36:56,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:36:56,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:36:56,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:36:55" (1/3) ... [2025-03-08 04:36:56,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6249f51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:36:56, skipping insertion in model container [2025-03-08 04:36:56,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:36:56" (2/3) ... [2025-03-08 04:36:56,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6249f51a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:36:56, skipping insertion in model container [2025-03-08 04:36:56,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:36:56" (3/3) ... [2025-03-08 04:36:56,427 INFO L128 eAbstractionObserver]: Analyzing ICFG eureka_01-2.c [2025-03-08 04:36:56,437 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:36:56,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG eureka_01-2.c that has 1 procedures, 19 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-08 04:36:56,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:36:56,479 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@21e146f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:36:56,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:36:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 04:36:56,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:56,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:56,486 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:56,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:56,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2026912553, now seen corresponding path program 1 times [2025-03-08 04:36:56,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:56,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599805872] [2025-03-08 04:36:56,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:56,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 04:36:56,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 04:36:56,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:56,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:56,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:36:56,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:56,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599805872] [2025-03-08 04:36:56,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599805872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:36:56,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:36:56,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:36:56,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301104831] [2025-03-08 04:36:56,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:36:56,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:36:56,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:56,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:36:56,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:36:56,901 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:56,935 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2025-03-08 04:36:56,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:36:56,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 04:36:56,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:56,941 INFO L225 Difference]: With dead ends: 36 [2025-03-08 04:36:56,941 INFO L226 Difference]: Without dead ends: 19 [2025-03-08 04:36:56,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:36:56,944 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:56,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 32 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:36:56,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-08 04:36:56,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2025-03-08 04:36:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2025-03-08 04:36:56,966 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 8 [2025-03-08 04:36:56,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:56,966 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-03-08 04:36:56,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2025-03-08 04:36:56,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 04:36:56,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:56,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:56,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:36:56,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:56,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:56,967 INFO L85 PathProgramCache]: Analyzing trace with hash -74656557, now seen corresponding path program 1 times [2025-03-08 04:36:56,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:56,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440854005] [2025-03-08 04:36:56,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:56,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:57,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-08 04:36:57,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 04:36:57,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:57,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:36:57,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:57,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440854005] [2025-03-08 04:36:57,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440854005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:36:57,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:36:57,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:36:57,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123981321] [2025-03-08 04:36:57,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:36:57,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:36:57,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:57,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:36:57,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:36:57,191 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:57,244 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2025-03-08 04:36:57,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:36:57,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-08 04:36:57,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:57,245 INFO L225 Difference]: With dead ends: 37 [2025-03-08 04:36:57,245 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 04:36:57,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:36:57,245 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:57,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 18 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:36:57,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 04:36:57,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2025-03-08 04:36:57,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2025-03-08 04:36:57,249 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 11 [2025-03-08 04:36:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:57,249 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-03-08 04:36:57,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:57,249 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2025-03-08 04:36:57,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 04:36:57,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:57,249 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:57,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:36:57,250 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:57,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:57,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1758905864, now seen corresponding path program 1 times [2025-03-08 04:36:57,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:57,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686216398] [2025-03-08 04:36:57,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:57,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:57,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-08 04:36:57,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 04:36:57,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:57,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:36:57,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:57,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686216398] [2025-03-08 04:36:57,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686216398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:36:57,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:36:57,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:36:57,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051256216] [2025-03-08 04:36:57,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:36:57,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:36:57,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:57,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:36:57,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:36:57,397 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:57,427 INFO L93 Difference]: Finished difference Result 32 states and 44 transitions. [2025-03-08 04:36:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:36:57,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 04:36:57,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:57,428 INFO L225 Difference]: With dead ends: 32 [2025-03-08 04:36:57,428 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 04:36:57,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:36:57,429 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:57,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 36 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:36:57,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 04:36:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2025-03-08 04:36:57,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2025-03-08 04:36:57,434 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 13 [2025-03-08 04:36:57,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:57,434 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-03-08 04:36:57,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2025-03-08 04:36:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 04:36:57,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:57,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:57,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 04:36:57,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:57,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:57,435 INFO L85 PathProgramCache]: Analyzing trace with hash 994622360, now seen corresponding path program 1 times [2025-03-08 04:36:57,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:57,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775672855] [2025-03-08 04:36:57,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:57,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:57,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 04:36:57,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 04:36:57,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:57,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:57,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:36:57,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:57,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775672855] [2025-03-08 04:36:57,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775672855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:36:57,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:36:57,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 04:36:57,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034709597] [2025-03-08 04:36:57,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:36:57,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:36:57,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:57,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:36:57,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:36:57,587 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:57,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:57,617 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-03-08 04:36:57,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:36:57,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 04:36:57,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:57,618 INFO L225 Difference]: With dead ends: 32 [2025-03-08 04:36:57,618 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 04:36:57,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 04:36:57,622 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:57,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 21 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:36:57,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 04:36:57,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2025-03-08 04:36:57,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2025-03-08 04:36:57,625 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 16 [2025-03-08 04:36:57,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:57,625 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2025-03-08 04:36:57,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:57,625 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2025-03-08 04:36:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 04:36:57,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:57,626 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:57,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:36:57,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:57,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:57,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1768210505, now seen corresponding path program 1 times [2025-03-08 04:36:57,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:57,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079789527] [2025-03-08 04:36:57,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:57,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:57,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 04:36:57,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:36:57,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:57,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:36:57,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:57,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079789527] [2025-03-08 04:36:57,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079789527] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:36:57,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216772932] [2025-03-08 04:36:57,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:57,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:57,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:36:57,783 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:36:57,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:36:57,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 04:36:57,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 04:36:57,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:57,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:57,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 04:36:57,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:36:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:36:57,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:36:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:36:58,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216772932] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:36:58,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:36:58,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-08 04:36:58,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507209433] [2025-03-08 04:36:58,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:36:58,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 04:36:58,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:58,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 04:36:58,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:36:58,022 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:58,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:58,077 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2025-03-08 04:36:58,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:36:58,078 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 04:36:58,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:58,078 INFO L225 Difference]: With dead ends: 43 [2025-03-08 04:36:58,078 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 04:36:58,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:36:58,079 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:58,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 33 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:36:58,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 04:36:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-08 04:36:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2025-03-08 04:36:58,083 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 18 [2025-03-08 04:36:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:58,083 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2025-03-08 04:36:58,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2025-03-08 04:36:58,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 04:36:58,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:58,083 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:58,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:36:58,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:58,284 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:58,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:58,285 INFO L85 PathProgramCache]: Analyzing trace with hash 130868787, now seen corresponding path program 2 times [2025-03-08 04:36:58,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:58,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483793427] [2025-03-08 04:36:58,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:36:58,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:58,323 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-08 04:36:58,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:36:58,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:36:58,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:58,440 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 04:36:58,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:58,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483793427] [2025-03-08 04:36:58,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483793427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:36:58,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479668686] [2025-03-08 04:36:58,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:36:58,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:58,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:36:58,443 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:36:58,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:36:58,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-08 04:36:58,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:36:58,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:36:58,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:58,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 04:36:58,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:36:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 04:36:58,726 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:36:58,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479668686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:36:58,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:36:58,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-08 04:36:58,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7620712] [2025-03-08 04:36:58,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:36:58,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:36:58,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:58,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:36:58,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:36:58,727 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:58,774 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2025-03-08 04:36:58,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:36:58,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 04:36:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:58,775 INFO L225 Difference]: With dead ends: 61 [2025-03-08 04:36:58,775 INFO L226 Difference]: Without dead ends: 39 [2025-03-08 04:36:58,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:36:58,776 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:58,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 25 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:36:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-08 04:36:58,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2025-03-08 04:36:58,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2025-03-08 04:36:58,782 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 27 [2025-03-08 04:36:58,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:58,783 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2025-03-08 04:36:58,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:58,783 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2025-03-08 04:36:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 04:36:58,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:58,784 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:58,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 04:36:58,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 04:36:58,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:58,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:58,988 INFO L85 PathProgramCache]: Analyzing trace with hash 852699156, now seen corresponding path program 1 times [2025-03-08 04:36:58,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:58,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988747909] [2025-03-08 04:36:58,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:58,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:59,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 04:36:59,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:36:59,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:59,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:36:59,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:59,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988747909] [2025-03-08 04:36:59,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988747909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:36:59,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980126393] [2025-03-08 04:36:59,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:36:59,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:59,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:36:59,153 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:36:59,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 04:36:59,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 04:36:59,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 04:36:59,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:36:59,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:59,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 04:36:59,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:36:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:36:59,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:36:59,436 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:36:59,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980126393] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:36:59,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:36:59,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-08 04:36:59,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18221206] [2025-03-08 04:36:59,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:36:59,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 04:36:59,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:36:59,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 04:36:59,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-03-08 04:36:59,438 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:59,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:36:59,498 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2025-03-08 04:36:59,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 04:36:59,498 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 04:36:59,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:36:59,498 INFO L225 Difference]: With dead ends: 48 [2025-03-08 04:36:59,498 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 04:36:59,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-03-08 04:36:59,499 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:36:59,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 67 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:36:59,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 04:36:59,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-03-08 04:36:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2025-03-08 04:36:59,505 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 27 [2025-03-08 04:36:59,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:36:59,505 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2025-03-08 04:36:59,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:36:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2025-03-08 04:36:59,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 04:36:59,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:36:59,506 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:36:59,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 04:36:59,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:59,707 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:36:59,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:36:59,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1707717257, now seen corresponding path program 2 times [2025-03-08 04:36:59,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:36:59,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632170040] [2025-03-08 04:36:59,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:36:59,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:36:59,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-08 04:36:59,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 04:36:59,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:36:59,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:36:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 04:36:59,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:36:59,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632170040] [2025-03-08 04:36:59,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632170040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:36:59,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588604940] [2025-03-08 04:36:59,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:36:59,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:36:59,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:36:59,818 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:36:59,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 04:36:59,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-08 04:37:00,039 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 04:37:00,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:37:00,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:37:00,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 04:37:00,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:37:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 04:37:00,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:37:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-08 04:37:00,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588604940] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:37:00,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:37:00,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 04:37:00,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80558845] [2025-03-08 04:37:00,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:37:00,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 04:37:00,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:37:00,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 04:37:00,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:37:00,141 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:37:00,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:37:00,227 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2025-03-08 04:37:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:37:00,228 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-08 04:37:00,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:37:00,229 INFO L225 Difference]: With dead ends: 78 [2025-03-08 04:37:00,229 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 04:37:00,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-08 04:37:00,230 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 119 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:37:00,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 41 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:37:00,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 04:37:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 47. [2025-03-08 04:37:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:37:00,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2025-03-08 04:37:00,236 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 30 [2025-03-08 04:37:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:37:00,236 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-03-08 04:37:00,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:37:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2025-03-08 04:37:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 04:37:00,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:37:00,237 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:37:00,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 04:37:00,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:37:00,438 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:37:00,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:37:00,438 INFO L85 PathProgramCache]: Analyzing trace with hash -356606286, now seen corresponding path program 3 times [2025-03-08 04:37:00,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:37:00,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155772972] [2025-03-08 04:37:00,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:37:00,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:37:00,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 8 equivalence classes. [2025-03-08 04:37:00,477 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 45 statements. [2025-03-08 04:37:00,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 04:37:00,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:37:00,536 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-08 04:37:00,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:37:00,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155772972] [2025-03-08 04:37:00,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155772972] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:37:00,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622632649] [2025-03-08 04:37:00,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:37:00,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:37:00,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:37:00,538 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:37:00,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 04:37:00,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 8 equivalence classes. [2025-03-08 04:37:00,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 45 statements. [2025-03-08 04:37:00,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 04:37:00,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:37:00,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 04:37:00,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:37:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-08 04:37:00,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:37:00,887 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-08 04:37:00,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622632649] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:37:00,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:37:00,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 04:37:00,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604066555] [2025-03-08 04:37:00,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:37:00,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 04:37:00,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:37:00,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 04:37:00,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:37:00,890 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:37:00,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:37:00,979 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2025-03-08 04:37:00,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:37:00,979 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-08 04:37:00,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:37:00,980 INFO L225 Difference]: With dead ends: 62 [2025-03-08 04:37:00,982 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 04:37:00,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-08 04:37:00,982 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 59 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:37:00,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 51 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:37:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 04:37:00,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2025-03-08 04:37:00,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:37:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2025-03-08 04:37:00,991 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 45 [2025-03-08 04:37:00,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:37:00,991 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2025-03-08 04:37:00,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:37:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2025-03-08 04:37:00,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 04:37:00,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:37:00,993 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:37:01,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 04:37:01,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:37:01,194 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:37:01,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:37:01,195 INFO L85 PathProgramCache]: Analyzing trace with hash 421805135, now seen corresponding path program 4 times [2025-03-08 04:37:01,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:37:01,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774927403] [2025-03-08 04:37:01,195 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:37:01,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:37:01,241 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-03-08 04:37:01,254 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 49 of 51 statements. [2025-03-08 04:37:01,254 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 04:37:01,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:37:01,338 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 20 proven. 19 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-08 04:37:01,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:37:01,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774927403] [2025-03-08 04:37:01,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774927403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:37:01,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898229382] [2025-03-08 04:37:01,339 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:37:01,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:37:01,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:37:01,341 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:37:01,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 04:37:01,440 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-03-08 04:37:01,461 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 49 of 51 statements. [2025-03-08 04:37:01,461 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 04:37:01,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:37:01,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 04:37:01,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:37:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 04:37:01,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:37:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 04:37:01,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898229382] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:37:01,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:37:01,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 11 [2025-03-08 04:37:01,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052382228] [2025-03-08 04:37:01,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:37:01,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 04:37:01,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:37:01,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 04:37:01,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:37:01,553 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:37:01,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:37:01,627 INFO L93 Difference]: Finished difference Result 103 states and 135 transitions. [2025-03-08 04:37:01,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 04:37:01,628 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-03-08 04:37:01,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:37:01,628 INFO L225 Difference]: With dead ends: 103 [2025-03-08 04:37:01,628 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 04:37:01,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-08 04:37:01,629 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:37:01,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 60 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:37:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 04:37:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 65. [2025-03-08 04:37:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:37:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2025-03-08 04:37:01,638 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 81 transitions. Word has length 51 [2025-03-08 04:37:01,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:37:01,639 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 81 transitions. [2025-03-08 04:37:01,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:37:01,639 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2025-03-08 04:37:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 04:37:01,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:37:01,639 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:37:01,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 04:37:01,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:37:01,840 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:37:01,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:37:01,841 INFO L85 PathProgramCache]: Analyzing trace with hash -322432861, now seen corresponding path program 5 times [2025-03-08 04:37:01,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:37:01,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904743552] [2025-03-08 04:37:01,841 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 04:37:01,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:37:01,887 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 63 statements into 12 equivalence classes. [2025-03-08 04:37:02,083 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 04:37:02,083 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-08 04:37:02,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:37:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 74 proven. 22 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-08 04:37:02,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:37:02,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904743552] [2025-03-08 04:37:02,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904743552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:37:02,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860977686] [2025-03-08 04:37:02,200 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 04:37:02,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:37:02,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:37:02,202 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:37:02,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 04:37:02,322 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 63 statements into 12 equivalence classes. [2025-03-08 04:37:02,820 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 04:37:02,820 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-08 04:37:02,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:37:02,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 04:37:02,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:37:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 91 proven. 5 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-08 04:37:02,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:37:02,939 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 74 proven. 22 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2025-03-08 04:37:02,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860977686] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:37:02,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:37:02,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-08 04:37:02,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565829631] [2025-03-08 04:37:02,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:37:02,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 04:37:02,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:37:02,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 04:37:02,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2025-03-08 04:37:02,940 INFO L87 Difference]: Start difference. First operand 65 states and 81 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:37:03,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:37:03,008 INFO L93 Difference]: Finished difference Result 152 states and 211 transitions. [2025-03-08 04:37:03,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 04:37:03,009 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-03-08 04:37:03,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:37:03,010 INFO L225 Difference]: With dead ends: 152 [2025-03-08 04:37:03,010 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 04:37:03,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2025-03-08 04:37:03,011 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 28 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:37:03,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 72 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:37:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 04:37:03,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-08 04:37:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 112 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:37:03,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 145 transitions. [2025-03-08 04:37:03,027 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 145 transitions. Word has length 63 [2025-03-08 04:37:03,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:37:03,028 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 145 transitions. [2025-03-08 04:37:03,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:37:03,028 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 145 transitions. [2025-03-08 04:37:03,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-08 04:37:03,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:37:03,030 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:37:03,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 04:37:03,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:37:03,230 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:37:03,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:37:03,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1612780451, now seen corresponding path program 6 times [2025-03-08 04:37:03,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:37:03,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812961045] [2025-03-08 04:37:03,231 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 04:37:03,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:37:03,271 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 111 statements into 28 equivalence classes. [2025-03-08 04:37:03,811 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 43 of 111 statements. [2025-03-08 04:37:03,811 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-08 04:37:03,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:37:47,733 WARN L286 SmtUtils]: Spent 11.00s on a formula simplification that was a NOOP. DAG size: 247 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)