./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.05.cil-1.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/combinations/Problem05_label49+token_ring.05.cil-1.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 211a040b667c92c6d715ed7462c0db91088ae0b583b29f60ca2f33cb3ca9ce8b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:59:41,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:59:41,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:59:41,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:59:41,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:59:41,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:59:41,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:59:41,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:59:41,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:59:41,479 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:59:41,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:59:41,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:59:41,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:59:41,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:59:41,479 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:59:41,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:59:41,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:59:41,479 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:59:41,480 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:59:41,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:59:41,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:59:41,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:59:41,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:59:41,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:59:41,480 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:59:41,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:59:41,480 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:59:41,480 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:59:41,480 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:59:41,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:59:41,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:59:41,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:59:41,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:59:41,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:59:41,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:59:41,481 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:59:41,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:59:41,481 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:59:41,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:59:41,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:59:41,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:59:41,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:59:41,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:59:41,481 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 -> 211a040b667c92c6d715ed7462c0db91088ae0b583b29f60ca2f33cb3ca9ce8b [2025-03-08 06:59:41,742 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:59:41,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:59:41,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:59:41,751 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:59:41,752 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:59:41,753 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.05.cil-1.c [2025-03-08 06:59:42,872 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa17e8f8c/fbc32f3168464cf4acefa6016727ecb2/FLAGf9c3216d5 [2025-03-08 06:59:43,357 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:59:43,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.05.cil-1.c [2025-03-08 06:59:43,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa17e8f8c/fbc32f3168464cf4acefa6016727ecb2/FLAGf9c3216d5 [2025-03-08 06:59:43,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa17e8f8c/fbc32f3168464cf4acefa6016727ecb2 [2025-03-08 06:59:43,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:59:43,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:59:43,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:59:43,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:59:43,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:59:43,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:59:43" (1/1) ... [2025-03-08 06:59:43,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2992ca7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:43, skipping insertion in model container [2025-03-08 06:59:43,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:59:43" (1/1) ... [2025-03-08 06:59:43,627 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:59:44,795 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/combinations/Problem05_label49+token_ring.05.cil-1.c[380593,380606] [2025-03-08 06:59:44,818 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/combinations/Problem05_label49+token_ring.05.cil-1.c[383339,383352] [2025-03-08 06:59:44,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:59:44,995 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:59:45,492 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/combinations/Problem05_label49+token_ring.05.cil-1.c[380593,380606] [2025-03-08 06:59:45,495 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/combinations/Problem05_label49+token_ring.05.cil-1.c[383339,383352] [2025-03-08 06:59:45,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:59:45,554 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:59:45,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:45 WrapperNode [2025-03-08 06:59:45,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:59:45,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:59:45,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:59:45,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:59:45,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:45" (1/1) ... [2025-03-08 06:59:45,623 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:45" (1/1) ... [2025-03-08 06:59:45,986 INFO L138 Inliner]: procedures = 54, calls = 56, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 12786 [2025-03-08 06:59:45,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:59:45,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:59:45,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:59:45,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:59:45,995 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:45" (1/1) ... [2025-03-08 06:59:45,995 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:45" (1/1) ... [2025-03-08 06:59:46,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:45" (1/1) ... [2025-03-08 06:59:46,182 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:59:46,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:45" (1/1) ... [2025-03-08 06:59:46,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:45" (1/1) ... [2025-03-08 06:59:46,349 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:45" (1/1) ... [2025-03-08 06:59:46,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:45" (1/1) ... [2025-03-08 06:59:46,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:45" (1/1) ... [2025-03-08 06:59:46,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:45" (1/1) ... [2025-03-08 06:59:46,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:59:46,496 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:59:46,496 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:59:46,496 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:59:46,497 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:45" (1/1) ... [2025-03-08 06:59:46,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:59:46,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:46,525 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 06:59:46,529 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 06:59:46,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:59:46,547 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:59:46,547 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:59:46,547 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:59:46,547 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:59:46,547 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:59:46,547 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:59:46,547 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:59:46,547 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:59:46,548 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:59:46,548 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:59:46,548 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:59:46,548 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:59:46,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:59:46,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:59:46,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:59:46,633 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:59:46,635 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:59:53,020 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:59:53,020 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:59:53,021 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:59:53,021 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:59:53,022 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:59:53,022 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:59:53,022 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:59:53,225 INFO L? ?]: Removed 1713 outVars from TransFormulas that were not future-live. [2025-03-08 06:59:53,226 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:59:53,274 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:59:53,276 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:59:53,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:59:53 BoogieIcfgContainer [2025-03-08 06:59:53,276 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:59:53,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:59:53,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:59:53,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:59:53,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:59:43" (1/3) ... [2025-03-08 06:59:53,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a96d8c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:59:53, skipping insertion in model container [2025-03-08 06:59:53,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:45" (2/3) ... [2025-03-08 06:59:53,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a96d8c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:59:53, skipping insertion in model container [2025-03-08 06:59:53,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:59:53" (3/3) ... [2025-03-08 06:59:53,285 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.05.cil-1.c [2025-03-08 06:59:53,298 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:59:53,300 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.05.cil-1.c that has 7 procedures, 2388 locations, 1 initial locations, 9 loop locations, and 2 error locations. [2025-03-08 06:59:53,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:59:53,388 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;@2a866c66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:59:53,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:59:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 2388 states, 2361 states have (on average 1.8487928843710293) internal successors, (4365), 2363 states have internal predecessors, (4365), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 06:59:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:59:53,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:53,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:53,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:53,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:53,412 INFO L85 PathProgramCache]: Analyzing trace with hash 393164962, now seen corresponding path program 1 times [2025-03-08 06:59:53,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:53,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192457343] [2025-03-08 06:59:53,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:53,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:53,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:59:53,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:59:53,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:53,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:53,787 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 06:59:53,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:53,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192457343] [2025-03-08 06:59:53,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192457343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:53,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:53,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:53,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908769037] [2025-03-08 06:59:53,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:53,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:53,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:53,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:53,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:53,816 INFO L87 Difference]: Start difference. First operand has 2388 states, 2361 states have (on average 1.8487928843710293) internal successors, (4365), 2363 states have internal predecessors, (4365), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:54,428 INFO L93 Difference]: Finished difference Result 4973 states and 9123 transitions. [2025-03-08 06:59:54,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:59:54,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:59:54,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:54,446 INFO L225 Difference]: With dead ends: 4973 [2025-03-08 06:59:54,448 INFO L226 Difference]: Without dead ends: 2528 [2025-03-08 06:59:54,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:54,459 INFO L435 NwaCegarLoop]: 4264 mSDtfsCounter, 4579 mSDsluCounter, 8647 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4592 SdHoareTripleChecker+Valid, 12911 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:54,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4592 Valid, 12911 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:59:54,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2025-03-08 06:59:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2513. [2025-03-08 06:59:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2465 states have (on average 1.8227180527383366) internal successors, (4493), 2468 states have internal predecessors, (4493), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-08 06:59:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 4560 transitions. [2025-03-08 06:59:54,580 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 4560 transitions. Word has length 99 [2025-03-08 06:59:54,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:54,581 INFO L471 AbstractCegarLoop]: Abstraction has 2513 states and 4560 transitions. [2025-03-08 06:59:54,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:54,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 4560 transitions. [2025-03-08 06:59:54,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:59:54,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:54,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:54,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:59:54,584 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:54,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:54,585 INFO L85 PathProgramCache]: Analyzing trace with hash -398788892, now seen corresponding path program 1 times [2025-03-08 06:59:54,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:54,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276020858] [2025-03-08 06:59:54,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:54,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:54,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:59:54,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:59:54,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:54,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:54,770 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 06:59:54,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:54,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276020858] [2025-03-08 06:59:54,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276020858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:54,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:54,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:54,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616619478] [2025-03-08 06:59:54,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:54,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:54,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:54,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:54,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:54,772 INFO L87 Difference]: Start difference. First operand 2513 states and 4560 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:55,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:55,006 INFO L93 Difference]: Finished difference Result 2928 states and 5211 transitions. [2025-03-08 06:59:55,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:55,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:59:55,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:55,020 INFO L225 Difference]: With dead ends: 2928 [2025-03-08 06:59:55,021 INFO L226 Difference]: Without dead ends: 2549 [2025-03-08 06:59:55,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:55,024 INFO L435 NwaCegarLoop]: 4183 mSDtfsCounter, 4356 mSDsluCounter, 8281 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4369 SdHoareTripleChecker+Valid, 12464 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:55,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4369 Valid, 12464 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:59:55,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2025-03-08 06:59:55,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2513. [2025-03-08 06:59:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2465 states have (on average 1.8219066937119675) internal successors, (4491), 2468 states have internal predecessors, (4491), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (34), 33 states have call predecessors, (34), 33 states have call successors, (34) [2025-03-08 06:59:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 4558 transitions. [2025-03-08 06:59:55,093 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 4558 transitions. Word has length 99 [2025-03-08 06:59:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:55,094 INFO L471 AbstractCegarLoop]: Abstraction has 2513 states and 4558 transitions. [2025-03-08 06:59:55,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 4558 transitions. [2025-03-08 06:59:55,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:59:55,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:55,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:55,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:59:55,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:55,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:55,103 INFO L85 PathProgramCache]: Analyzing trace with hash 384590083, now seen corresponding path program 1 times [2025-03-08 06:59:55,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:55,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144307908] [2025-03-08 06:59:55,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:55,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:55,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:59:55,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:59:55,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:55,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:55,262 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 06:59:55,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:55,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144307908] [2025-03-08 06:59:55,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144307908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:55,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:55,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:55,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380345999] [2025-03-08 06:59:55,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:55,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:55,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:55,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:55,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:55,265 INFO L87 Difference]: Start difference. First operand 2513 states and 4558 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:55,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:55,731 INFO L93 Difference]: Finished difference Result 3129 states and 5513 transitions. [2025-03-08 06:59:55,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:55,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:59:55,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:55,741 INFO L225 Difference]: With dead ends: 3129 [2025-03-08 06:59:55,741 INFO L226 Difference]: Without dead ends: 2750 [2025-03-08 06:59:55,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:59:55,744 INFO L435 NwaCegarLoop]: 4343 mSDtfsCounter, 4500 mSDsluCounter, 13021 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4513 SdHoareTripleChecker+Valid, 17364 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:55,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4513 Valid, 17364 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:59:55,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2025-03-08 06:59:55,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2691. [2025-03-08 06:59:55,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2691 states, 2622 states have (on average 1.8035850495804728) internal successors, (4729), 2626 states have internal predecessors, (4729), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (51), 48 states have call predecessors, (51), 47 states have call successors, (51) [2025-03-08 06:59:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 4827 transitions. [2025-03-08 06:59:55,867 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 4827 transitions. Word has length 99 [2025-03-08 06:59:55,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:55,868 INFO L471 AbstractCegarLoop]: Abstraction has 2691 states and 4827 transitions. [2025-03-08 06:59:55,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 4827 transitions. [2025-03-08 06:59:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:59:55,871 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:55,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:55,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:59:55,873 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:55,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:55,873 INFO L85 PathProgramCache]: Analyzing trace with hash -144328956, now seen corresponding path program 1 times [2025-03-08 06:59:55,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:55,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36036230] [2025-03-08 06:59:55,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:55,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:55,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:59:55,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:59:55,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:55,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:56,092 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 06:59:56,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:56,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36036230] [2025-03-08 06:59:56,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36036230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:56,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:56,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:56,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742615504] [2025-03-08 06:59:56,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:56,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:56,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:56,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:56,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:56,093 INFO L87 Difference]: Start difference. First operand 2691 states and 4827 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:56,680 INFO L93 Difference]: Finished difference Result 3688 states and 6369 transitions. [2025-03-08 06:59:56,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:56,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:59:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:56,692 INFO L225 Difference]: With dead ends: 3688 [2025-03-08 06:59:56,692 INFO L226 Difference]: Without dead ends: 3131 [2025-03-08 06:59:56,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:59:56,696 INFO L435 NwaCegarLoop]: 4339 mSDtfsCounter, 4495 mSDsluCounter, 13009 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4508 SdHoareTripleChecker+Valid, 17348 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:56,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4508 Valid, 17348 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:59:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2025-03-08 06:59:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 3066. [2025-03-08 06:59:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3066 states, 2953 states have (on average 1.7731120894006096) internal successors, (5236), 2961 states have internal predecessors, (5236), 75 states have call successors, (75), 30 states have call predecessors, (75), 36 states have return successors, (91), 78 states have call predecessors, (91), 75 states have call successors, (91) [2025-03-08 06:59:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 5402 transitions. [2025-03-08 06:59:56,776 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 5402 transitions. Word has length 99 [2025-03-08 06:59:56,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:56,777 INFO L471 AbstractCegarLoop]: Abstraction has 3066 states and 5402 transitions. [2025-03-08 06:59:56,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 5402 transitions. [2025-03-08 06:59:56,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:59:56,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:56,778 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:56,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:59:56,779 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:56,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:56,779 INFO L85 PathProgramCache]: Analyzing trace with hash -715580189, now seen corresponding path program 1 times [2025-03-08 06:59:56,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:56,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932167844] [2025-03-08 06:59:56,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:56,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:56,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:59:56,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:59:56,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:56,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:56,901 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 06:59:56,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:56,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932167844] [2025-03-08 06:59:56,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932167844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:56,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:56,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:56,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297071746] [2025-03-08 06:59:56,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:56,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:56,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:56,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:56,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:56,906 INFO L87 Difference]: Start difference. First operand 3066 states and 5402 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:57,375 INFO L93 Difference]: Finished difference Result 4877 states and 8226 transitions. [2025-03-08 06:59:57,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:57,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:59:57,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:57,391 INFO L225 Difference]: With dead ends: 4877 [2025-03-08 06:59:57,391 INFO L226 Difference]: Without dead ends: 3945 [2025-03-08 06:59:57,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:59:57,397 INFO L435 NwaCegarLoop]: 4336 mSDtfsCounter, 4490 mSDsluCounter, 13000 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4503 SdHoareTripleChecker+Valid, 17336 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:57,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4503 Valid, 17336 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:59:57,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2025-03-08 06:59:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 3867. [2025-03-08 06:59:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3867 states, 3660 states have (on average 1.7300546448087433) internal successors, (6332), 3682 states have internal predecessors, (6332), 131 states have call successors, (131), 54 states have call predecessors, (131), 74 states have return successors, (195), 138 states have call predecessors, (195), 131 states have call successors, (195) [2025-03-08 06:59:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3867 states to 3867 states and 6658 transitions. [2025-03-08 06:59:57,598 INFO L78 Accepts]: Start accepts. Automaton has 3867 states and 6658 transitions. Word has length 99 [2025-03-08 06:59:57,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:57,598 INFO L471 AbstractCegarLoop]: Abstraction has 3867 states and 6658 transitions. [2025-03-08 06:59:57,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:57,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3867 states and 6658 transitions. [2025-03-08 06:59:57,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:59:57,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:57,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:57,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:59:57,601 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:57,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:57,601 INFO L85 PathProgramCache]: Analyzing trace with hash -595460316, now seen corresponding path program 1 times [2025-03-08 06:59:57,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:57,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692183153] [2025-03-08 06:59:57,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:57,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:57,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:59:57,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:59:57,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:57,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:57,747 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 06:59:57,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:57,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692183153] [2025-03-08 06:59:57,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692183153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:57,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:57,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:57,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030926907] [2025-03-08 06:59:57,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:57,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:57,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:57,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:57,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:57,749 INFO L87 Difference]: Start difference. First operand 3867 states and 6658 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:58,316 INFO L93 Difference]: Finished difference Result 7722 states and 12757 transitions. [2025-03-08 06:59:58,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:58,316 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:59:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:58,344 INFO L225 Difference]: With dead ends: 7722 [2025-03-08 06:59:58,344 INFO L226 Difference]: Without dead ends: 5989 [2025-03-08 06:59:58,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:59:58,354 INFO L435 NwaCegarLoop]: 4327 mSDtfsCounter, 4646 mSDsluCounter, 12970 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4665 SdHoareTripleChecker+Valid, 17297 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:58,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4665 Valid, 17297 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:59:58,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5989 states. [2025-03-08 06:59:58,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5989 to 5553. [2025-03-08 06:59:58,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5553 states, 5148 states have (on average 1.6833721833721833) internal successors, (8666), 5216 states have internal predecessors, (8666), 235 states have call successors, (235), 102 states have call predecessors, (235), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-03-08 06:59:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5553 states to 5553 states and 9392 transitions. [2025-03-08 06:59:58,596 INFO L78 Accepts]: Start accepts. Automaton has 5553 states and 9392 transitions. Word has length 99 [2025-03-08 06:59:58,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:58,596 INFO L471 AbstractCegarLoop]: Abstraction has 5553 states and 9392 transitions. [2025-03-08 06:59:58,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 5553 states and 9392 transitions. [2025-03-08 06:59:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:59:58,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:58,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:58,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:59:58,601 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:58,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:58,601 INFO L85 PathProgramCache]: Analyzing trace with hash -581927515, now seen corresponding path program 1 times [2025-03-08 06:59:58,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:58,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274214318] [2025-03-08 06:59:58,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:58,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:58,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:59:58,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:59:58,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:58,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:58,687 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 06:59:58,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:58,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274214318] [2025-03-08 06:59:58,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274214318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:58,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:58,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:58,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962278401] [2025-03-08 06:59:58,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:58,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:58,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:58,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:58,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:58,692 INFO L87 Difference]: Start difference. First operand 5553 states and 9392 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:58,980 INFO L93 Difference]: Finished difference Result 9470 states and 15844 transitions. [2025-03-08 06:59:58,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:58,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 06:59:58,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:59,014 INFO L225 Difference]: With dead ends: 9470 [2025-03-08 06:59:59,015 INFO L226 Difference]: Without dead ends: 6051 [2025-03-08 06:59:59,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:59,027 INFO L435 NwaCegarLoop]: 4170 mSDtfsCounter, 4346 mSDsluCounter, 8254 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4359 SdHoareTripleChecker+Valid, 12424 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:59,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4359 Valid, 12424 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:59:59,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6051 states. [2025-03-08 06:59:59,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6051 to 5553. [2025-03-08 06:59:59,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5553 states, 5148 states have (on average 1.68006993006993) internal successors, (8649), 5216 states have internal predecessors, (8649), 235 states have call successors, (235), 102 states have call predecessors, (235), 168 states have return successors, (491), 250 states have call predecessors, (491), 235 states have call successors, (491) [2025-03-08 06:59:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5553 states to 5553 states and 9375 transitions. [2025-03-08 06:59:59,205 INFO L78 Accepts]: Start accepts. Automaton has 5553 states and 9375 transitions. Word has length 99 [2025-03-08 06:59:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:59,206 INFO L471 AbstractCegarLoop]: Abstraction has 5553 states and 9375 transitions. [2025-03-08 06:59:59,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 5553 states and 9375 transitions. [2025-03-08 06:59:59,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:59:59,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:59,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:59,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:59:59,209 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:59,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash 526887684, now seen corresponding path program 1 times [2025-03-08 06:59:59,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:59,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566949334] [2025-03-08 06:59:59,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:59,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:59,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:59:59,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:59:59,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:59,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:59,413 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 06:59:59,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:59,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566949334] [2025-03-08 06:59:59,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566949334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:59,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:59,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:59,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140100483] [2025-03-08 06:59:59,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:59,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:59,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:59,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:59,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:59,415 INFO L87 Difference]: Start difference. First operand 5553 states and 9375 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:00:00,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:00:00,226 INFO L93 Difference]: Finished difference Result 13110 states and 21742 transitions. [2025-03-08 07:00:00,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:00:00,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 07:00:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:00:00,261 INFO L225 Difference]: With dead ends: 13110 [2025-03-08 07:00:00,261 INFO L226 Difference]: Without dead ends: 9691 [2025-03-08 07:00:00,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:00:00,277 INFO L435 NwaCegarLoop]: 4319 mSDtfsCounter, 4573 mSDsluCounter, 12947 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4592 SdHoareTripleChecker+Valid, 17266 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 07:00:00,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4592 Valid, 17266 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 07:00:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9691 states. [2025-03-08 07:00:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9691 to 9117. [2025-03-08 07:00:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9117 states, 8270 states have (on average 1.6380894800483676) internal successors, (13547), 8484 states have internal predecessors, (13547), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-08 07:00:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9117 states to 9117 states and 15441 transitions. [2025-03-08 07:00:00,661 INFO L78 Accepts]: Start accepts. Automaton has 9117 states and 15441 transitions. Word has length 99 [2025-03-08 07:00:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:00:00,661 INFO L471 AbstractCegarLoop]: Abstraction has 9117 states and 15441 transitions. [2025-03-08 07:00:00,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:00:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 9117 states and 15441 transitions. [2025-03-08 07:00:00,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 07:00:00,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:00:00,670 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:00:00,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 07:00:00,670 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:00:00,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:00:00,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1393939909, now seen corresponding path program 1 times [2025-03-08 07:00:00,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:00:00,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005041764] [2025-03-08 07:00:00,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:00,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:00:00,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 07:00:00,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 07:00:00,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:00,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:00,747 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 07:00:00,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:00:00,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005041764] [2025-03-08 07:00:00,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005041764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:00:00,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:00:00,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:00:00,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382472812] [2025-03-08 07:00:00,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:00:00,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:00:00,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:00:00,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:00:00,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:00:00,749 INFO L87 Difference]: Start difference. First operand 9117 states and 15441 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:00:01,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:00:01,193 INFO L93 Difference]: Finished difference Result 17080 states and 29220 transitions. [2025-03-08 07:00:01,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:00:01,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 07:00:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:00:01,235 INFO L225 Difference]: With dead ends: 17080 [2025-03-08 07:00:01,235 INFO L226 Difference]: Without dead ends: 10097 [2025-03-08 07:00:01,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:00:01,261 INFO L435 NwaCegarLoop]: 4165 mSDtfsCounter, 4342 mSDsluCounter, 8245 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4355 SdHoareTripleChecker+Valid, 12410 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:00:01,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4355 Valid, 12410 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:00:01,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10097 states. [2025-03-08 07:00:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10097 to 9117. [2025-03-08 07:00:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9117 states, 8270 states have (on average 1.63409915356711) internal successors, (13514), 8484 states have internal predecessors, (13514), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-08 07:00:01,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9117 states to 9117 states and 15408 transitions. [2025-03-08 07:00:01,930 INFO L78 Accepts]: Start accepts. Automaton has 9117 states and 15408 transitions. Word has length 99 [2025-03-08 07:00:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:00:01,930 INFO L471 AbstractCegarLoop]: Abstraction has 9117 states and 15408 transitions. [2025-03-08 07:00:01,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:00:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 9117 states and 15408 transitions. [2025-03-08 07:00:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 07:00:01,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:00:01,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:00:01,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 07:00:01,937 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:00:01,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:00:01,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1837551332, now seen corresponding path program 1 times [2025-03-08 07:00:01,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:00:01,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348837409] [2025-03-08 07:00:01,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:01,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:00:01,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 07:00:01,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 07:00:01,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:01,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:02,015 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 07:00:02,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:00:02,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348837409] [2025-03-08 07:00:02,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348837409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:00:02,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:00:02,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 07:00:02,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266807865] [2025-03-08 07:00:02,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:00:02,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 07:00:02,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:00:02,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 07:00:02,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 07:00:02,017 INFO L87 Difference]: Start difference. First operand 9117 states and 15408 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:00:02,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:00:02,470 INFO L93 Difference]: Finished difference Result 16835 states and 28664 transitions. [2025-03-08 07:00:02,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:00:02,470 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 07:00:02,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:00:02,512 INFO L225 Difference]: With dead ends: 16835 [2025-03-08 07:00:02,512 INFO L226 Difference]: Without dead ends: 9852 [2025-03-08 07:00:02,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:00:02,535 INFO L435 NwaCegarLoop]: 4162 mSDtfsCounter, 4339 mSDsluCounter, 8240 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4352 SdHoareTripleChecker+Valid, 12402 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 07:00:02,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4352 Valid, 12402 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 07:00:02,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9852 states. [2025-03-08 07:00:02,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9852 to 9117. [2025-03-08 07:00:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9117 states, 8270 states have (on average 1.6301088270858526) internal successors, (13481), 8484 states have internal predecessors, (13481), 435 states have call successors, (435), 198 states have call predecessors, (435), 410 states have return successors, (1459), 466 states have call predecessors, (1459), 435 states have call successors, (1459) [2025-03-08 07:00:02,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9117 states to 9117 states and 15375 transitions. [2025-03-08 07:00:02,958 INFO L78 Accepts]: Start accepts. Automaton has 9117 states and 15375 transitions. Word has length 99 [2025-03-08 07:00:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:00:02,958 INFO L471 AbstractCegarLoop]: Abstraction has 9117 states and 15375 transitions. [2025-03-08 07:00:02,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:00:02,958 INFO L276 IsEmpty]: Start isEmpty. Operand 9117 states and 15375 transitions. [2025-03-08 07:00:02,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 07:00:02,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:00:02,963 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:00:02,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 07:00:02,963 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:00:02,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:00:02,964 INFO L85 PathProgramCache]: Analyzing trace with hash 882030053, now seen corresponding path program 1 times [2025-03-08 07:00:02,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:00:02,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378203895] [2025-03-08 07:00:02,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:02,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:00:02,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 07:00:02,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 07:00:02,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:02,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:03,055 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 07:00:03,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:00:03,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378203895] [2025-03-08 07:00:03,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378203895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:00:03,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:00:03,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 07:00:03,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812951039] [2025-03-08 07:00:03,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:00:03,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 07:00:03,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:00:03,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 07:00:03,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:00:03,057 INFO L87 Difference]: Start difference. First operand 9117 states and 15375 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:00:04,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:00:04,016 INFO L93 Difference]: Finished difference Result 23602 states and 40544 transitions. [2025-03-08 07:00:04,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 07:00:04,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 07:00:04,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:00:04,072 INFO L225 Difference]: With dead ends: 23602 [2025-03-08 07:00:04,073 INFO L226 Difference]: Without dead ends: 16619 [2025-03-08 07:00:04,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 07:00:04,093 INFO L435 NwaCegarLoop]: 4306 mSDtfsCounter, 4462 mSDsluCounter, 12910 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4481 SdHoareTripleChecker+Valid, 17216 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 07:00:04,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4481 Valid, 17216 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 07:00:04,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16619 states. [2025-03-08 07:00:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16619 to 16278. [2025-03-08 07:00:05,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16278 states, 14401 states have (on average 1.58607041177696) internal successors, (22841), 15069 states have internal predecessors, (22841), 819 states have call successors, (819), 390 states have call predecessors, (819), 1056 states have return successors, (4915), 882 states have call predecessors, (4915), 819 states have call successors, (4915) [2025-03-08 07:00:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16278 states to 16278 states and 28575 transitions. [2025-03-08 07:00:05,212 INFO L78 Accepts]: Start accepts. Automaton has 16278 states and 28575 transitions. Word has length 99 [2025-03-08 07:00:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:00:05,213 INFO L471 AbstractCegarLoop]: Abstraction has 16278 states and 28575 transitions. [2025-03-08 07:00:05,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:00:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 16278 states and 28575 transitions. [2025-03-08 07:00:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 07:00:05,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:00:05,223 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:00:05,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 07:00:05,223 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:00:05,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:00:05,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1227003196, now seen corresponding path program 1 times [2025-03-08 07:00:05,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:00:05,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569552819] [2025-03-08 07:00:05,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:05,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:00:05,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 07:00:05,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 07:00:05,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:05,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:05,278 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 07:00:05,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:00:05,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569552819] [2025-03-08 07:00:05,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569552819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:00:05,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 07:00:05,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 07:00:05,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854206271] [2025-03-08 07:00:05,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:00:05,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 07:00:05,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:00:05,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 07:00:05,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:00:05,279 INFO L87 Difference]: Start difference. First operand 16278 states and 28575 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:00:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:00:06,675 INFO L93 Difference]: Finished difference Result 44301 states and 78093 transitions. [2025-03-08 07:00:06,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 07:00:06,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 99 [2025-03-08 07:00:06,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:00:06,791 INFO L225 Difference]: With dead ends: 44301 [2025-03-08 07:00:06,791 INFO L226 Difference]: Without dead ends: 30158 [2025-03-08 07:00:06,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 07:00:06,832 INFO L435 NwaCegarLoop]: 4519 mSDtfsCounter, 4472 mSDsluCounter, 4448 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4472 SdHoareTripleChecker+Valid, 8967 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 07:00:06,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4472 Valid, 8967 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 07:00:06,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30158 states. [2025-03-08 07:00:08,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30158 to 30093. [2025-03-08 07:00:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30093 states, 26345 states have (on average 1.550996394002657) internal successors, (40861), 27744 states have internal predecessors, (40861), 1634 states have call successors, (1634), 780 states have call predecessors, (1634), 2112 states have return successors, (9763), 1632 states have call predecessors, (9763), 1634 states have call successors, (9763) [2025-03-08 07:00:08,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30093 states to 30093 states and 52258 transitions. [2025-03-08 07:00:08,955 INFO L78 Accepts]: Start accepts. Automaton has 30093 states and 52258 transitions. Word has length 99 [2025-03-08 07:00:08,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:00:08,956 INFO L471 AbstractCegarLoop]: Abstraction has 30093 states and 52258 transitions. [2025-03-08 07:00:08,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 07:00:08,956 INFO L276 IsEmpty]: Start isEmpty. Operand 30093 states and 52258 transitions. [2025-03-08 07:00:08,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 07:00:08,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:00:08,996 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:00:08,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 07:00:08,996 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:00:08,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:00:08,997 INFO L85 PathProgramCache]: Analyzing trace with hash 691072027, now seen corresponding path program 1 times [2025-03-08 07:00:08,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:00:08,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147706054] [2025-03-08 07:00:08,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:08,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:00:09,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 07:00:09,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 07:00:09,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:09,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:00:09,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:00:09,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147706054] [2025-03-08 07:00:09,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147706054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:00:09,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984045453] [2025-03-08 07:00:09,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:09,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:00:09,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:00:09,062 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 07:00:09,064 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 07:00:09,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 07:00:09,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 07:00:09,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:09,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:09,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:00:09,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:00:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-08 07:00:09,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:00:09,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984045453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:00:09,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:00:09,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 07:00:09,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092393113] [2025-03-08 07:00:09,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:00:09,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:00:09,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:00:09,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:00:09,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:00:09,250 INFO L87 Difference]: Start difference. First operand 30093 states and 52258 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:00:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:00:11,421 INFO L93 Difference]: Finished difference Result 85358 states and 148558 transitions. [2025-03-08 07:00:11,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:00:11,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 161 [2025-03-08 07:00:11,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:00:11,700 INFO L225 Difference]: With dead ends: 85358 [2025-03-08 07:00:11,701 INFO L226 Difference]: Without dead ends: 57400 [2025-03-08 07:00:11,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:00:11,771 INFO L435 NwaCegarLoop]: 4255 mSDtfsCounter, 4205 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4205 SdHoareTripleChecker+Valid, 4524 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:00:11,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4205 Valid, 4524 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:00:11,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57400 states. [2025-03-08 07:00:14,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57400 to 57268. [2025-03-08 07:00:14,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57268 states, 49908 states have (on average 1.5369479842910956) internal successors, (76706), 52704 states have internal predecessors, (76706), 3134 states have call successors, (3134), 1560 states have call predecessors, (3134), 4224 states have return successors, (19329), 3067 states have call predecessors, (19329), 3134 states have call successors, (19329) [2025-03-08 07:00:15,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57268 states to 57268 states and 99169 transitions. [2025-03-08 07:00:15,108 INFO L78 Accepts]: Start accepts. Automaton has 57268 states and 99169 transitions. Word has length 161 [2025-03-08 07:00:15,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:00:15,109 INFO L471 AbstractCegarLoop]: Abstraction has 57268 states and 99169 transitions. [2025-03-08 07:00:15,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:00:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 57268 states and 99169 transitions. [2025-03-08 07:00:15,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 07:00:15,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:00:15,173 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:00:15,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 07:00:15,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 07:00:15,379 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:00:15,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:00:15,379 INFO L85 PathProgramCache]: Analyzing trace with hash 363276065, now seen corresponding path program 1 times [2025-03-08 07:00:15,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:00:15,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384067992] [2025-03-08 07:00:15,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:15,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:00:15,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 07:00:15,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 07:00:15,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:15,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:15,445 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:00:15,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:00:15,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384067992] [2025-03-08 07:00:15,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384067992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:00:15,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286884952] [2025-03-08 07:00:15,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:15,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:00:15,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:00:15,448 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 07:00:15,451 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 07:00:15,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 07:00:15,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 07:00:15,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:15,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:15,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:00:15,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:00:15,617 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 07:00:15,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:00:15,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286884952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:00:15,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:00:15,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 07:00:15,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403267716] [2025-03-08 07:00:15,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:00:15,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:00:15,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:00:15,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:00:15,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:00:15,620 INFO L87 Difference]: Start difference. First operand 57268 states and 99169 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:00:20,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:00:20,582 INFO L93 Difference]: Finished difference Result 166233 states and 288971 transitions. [2025-03-08 07:00:20,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:00:20,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 161 [2025-03-08 07:00:20,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:00:21,030 INFO L225 Difference]: With dead ends: 166233 [2025-03-08 07:00:21,030 INFO L226 Difference]: Without dead ends: 111100 [2025-03-08 07:00:21,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:00:21,137 INFO L435 NwaCegarLoop]: 4255 mSDtfsCounter, 4199 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4199 SdHoareTripleChecker+Valid, 4524 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 07:00:21,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4199 Valid, 4524 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:00:21,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111100 states. [2025-03-08 07:00:26,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111100 to 110838. [2025-03-08 07:00:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110838 states, 96384 states have (on average 1.5288429614873837) internal successors, (147356), 101974 states have internal predecessors, (147356), 6004 states have call successors, (6004), 3120 states have call predecessors, (6004), 8448 states have return successors, (38331), 5807 states have call predecessors, (38331), 6004 states have call successors, (38331) [2025-03-08 07:00:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110838 states to 110838 states and 191691 transitions. [2025-03-08 07:00:27,416 INFO L78 Accepts]: Start accepts. Automaton has 110838 states and 191691 transitions. Word has length 161 [2025-03-08 07:00:27,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:00:27,416 INFO L471 AbstractCegarLoop]: Abstraction has 110838 states and 191691 transitions. [2025-03-08 07:00:27,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 07:00:27,416 INFO L276 IsEmpty]: Start isEmpty. Operand 110838 states and 191691 transitions. [2025-03-08 07:00:27,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-08 07:00:27,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:00:27,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:00:27,502 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 07:00:27,696 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,SelfDestructingSolverStorable13 [2025-03-08 07:00:27,697 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:00:27,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:00:27,698 INFO L85 PathProgramCache]: Analyzing trace with hash 974102183, now seen corresponding path program 1 times [2025-03-08 07:00:27,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:00:27,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634680431] [2025-03-08 07:00:27,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:27,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:00:27,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 07:00:27,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 07:00:27,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:27,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:27,769 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 07:00:27,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:00:27,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634680431] [2025-03-08 07:00:27,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634680431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:00:27,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061617771] [2025-03-08 07:00:27,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:27,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:00:27,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:00:27,772 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 07:00:27,780 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 07:00:27,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-08 07:00:27,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-08 07:00:27,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:27,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:27,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:00:27,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:00:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 07:00:27,957 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:00:27,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061617771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:00:27,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:00:27,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 07:00:27,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866335160] [2025-03-08 07:00:27,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:00:27,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:00:27,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:00:27,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:00:27,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:00:27,962 INFO L87 Difference]: Start difference. First operand 110838 states and 191691 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)