./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 b08ac6f553c71235d6c242059db3dcace1924bc9c3a272f401632c3f1b127664 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:06:14,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:06:14,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 05:06:14,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:06:14,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:06:14,496 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:06:14,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:06:14,497 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:06:14,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:06:14,498 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:06:14,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:06:14,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:06:14,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:06:14,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:06:14,500 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:06:14,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:06:14,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:06:14,501 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:06:14,501 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:06:14,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:06:14,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:06:14,505 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:06:14,505 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:06:14,505 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:06:14,505 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:06:14,505 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:06:14,505 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:06:14,505 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:06:14,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:06:14,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:06:14,506 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:06:14,506 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:06:14,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:06:14,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:06:14,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:06:14,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:06:14,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:06:14,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:06:14,507 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:06:14,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:06:14,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:06:14,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:06:14,509 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> b08ac6f553c71235d6c242059db3dcace1924bc9c3a272f401632c3f1b127664 [2024-10-11 05:06:14,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:06:14,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:06:14,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:06:14,729 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:06:14,730 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:06:14,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-1.c [2024-10-11 05:06:16,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:06:16,214 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:06:16,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-1.c [2024-10-11 05:06:16,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/150ad7889/7dceac869da24c87b22e1ea521783db1/FLAGe0ceddc1b [2024-10-11 05:06:16,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/150ad7889/7dceac869da24c87b22e1ea521783db1 [2024-10-11 05:06:16,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:06:16,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:06:16,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:06:16,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:06:16,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:06:16,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:06:16" (1/1) ... [2024-10-11 05:06:16,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d432c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:16, skipping insertion in model container [2024-10-11 05:06:16,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:06:16" (1/1) ... [2024-10-11 05:06:16,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:06:16,805 WARN L248 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/pc_sfifo_3.cil+token_ring.07.cil-1.c[911,924] [2024-10-11 05:06:16,865 WARN L248 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/pc_sfifo_3.cil+token_ring.07.cil-1.c[8416,8429] [2024-10-11 05:06:16,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:06:16,948 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:06:16,957 WARN L248 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/pc_sfifo_3.cil+token_ring.07.cil-1.c[911,924] [2024-10-11 05:06:16,978 WARN L248 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/pc_sfifo_3.cil+token_ring.07.cil-1.c[8416,8429] [2024-10-11 05:06:17,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:06:17,038 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:06:17,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:17 WrapperNode [2024-10-11 05:06:17,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:06:17,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:06:17,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:06:17,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:06:17,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:17" (1/1) ... [2024-10-11 05:06:17,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:17" (1/1) ... [2024-10-11 05:06:17,094 INFO L138 Inliner]: procedures = 69, calls = 82, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 806 [2024-10-11 05:06:17,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:06:17,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:06:17,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:06:17,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:06:17,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:17" (1/1) ... [2024-10-11 05:06:17,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:17" (1/1) ... [2024-10-11 05:06:17,111 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:17" (1/1) ... [2024-10-11 05:06:17,126 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]. [2024-10-11 05:06:17,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:17" (1/1) ... [2024-10-11 05:06:17,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:17" (1/1) ... [2024-10-11 05:06:17,142 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:17" (1/1) ... [2024-10-11 05:06:17,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:17" (1/1) ... [2024-10-11 05:06:17,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:17" (1/1) ... [2024-10-11 05:06:17,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:17" (1/1) ... [2024-10-11 05:06:17,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:06:17,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:06:17,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:06:17,171 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:06:17,172 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:17" (1/1) ... [2024-10-11 05:06:17,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:06:17,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:06:17,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:06:17,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:06:17,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:06:17,247 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:06:17,247 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:06:17,247 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-11 05:06:17,249 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-11 05:06:17,249 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:06:17,249 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:06:17,249 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:06:17,249 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:06:17,250 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-11 05:06:17,250 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-11 05:06:17,250 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:06:17,250 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:06:17,250 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:06:17,250 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:06:17,250 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-11 05:06:17,250 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-11 05:06:17,251 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-11 05:06:17,251 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-11 05:06:17,251 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-11 05:06:17,251 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-11 05:06:17,251 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:06:17,251 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:06:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:06:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:06:17,252 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:06:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-11 05:06:17,253 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-11 05:06:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:06:17,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:06:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:06:17,253 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:06:17,363 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:06:17,365 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:06:17,908 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-10-11 05:06:17,908 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-10-11 05:06:18,039 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-10-11 05:06:18,040 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:06:18,106 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:06:18,108 INFO L314 CfgBuilder]: Removed 14 assume(true) statements. [2024-10-11 05:06:18,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:06:18 BoogieIcfgContainer [2024-10-11 05:06:18,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:06:18,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:06:18,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:06:18,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:06:18,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:06:16" (1/3) ... [2024-10-11 05:06:18,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea7ba8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:06:18, skipping insertion in model container [2024-10-11 05:06:18,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:06:17" (2/3) ... [2024-10-11 05:06:18,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ea7ba8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:06:18, skipping insertion in model container [2024-10-11 05:06:18,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:06:18" (3/3) ... [2024-10-11 05:06:18,115 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.07.cil-1.c [2024-10-11 05:06:18,127 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:06:18,128 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:06:18,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:06:18,199 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;@2dc5926f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:06:18,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:06:18,206 INFO L276 IsEmpty]: Start isEmpty. Operand has 337 states, 283 states have (on average 1.6925795053003534) internal successors, (479), 289 states have internal predecessors, (479), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 05:06:18,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:06:18,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:18,221 INFO L215 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] [2024-10-11 05:06:18,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:18,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:18,227 INFO L85 PathProgramCache]: Analyzing trace with hash -919630782, now seen corresponding path program 1 times [2024-10-11 05:06:18,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:18,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770853394] [2024-10-11 05:06:18,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:18,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:06:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:06:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:18,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:18,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770853394] [2024-10-11 05:06:18,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770853394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:18,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:18,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:06:18,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191396176] [2024-10-11 05:06:18,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:18,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:06:18,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:18,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:06:18,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:06:18,581 INFO L87 Difference]: Start difference. First operand has 337 states, 283 states have (on average 1.6925795053003534) internal successors, (479), 289 states have internal predecessors, (479), 37 states have call successors, (37), 14 states have call predecessors, (37), 14 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:06:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:19,384 INFO L93 Difference]: Finished difference Result 672 states and 1099 transitions. [2024-10-11 05:06:19,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:06:19,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-11 05:06:19,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:19,396 INFO L225 Difference]: With dead ends: 672 [2024-10-11 05:06:19,396 INFO L226 Difference]: Without dead ends: 349 [2024-10-11 05:06:19,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:06:19,402 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 763 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:19,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 846 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:06:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-11 05:06:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 332. [2024-10-11 05:06:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 280 states have (on average 1.582142857142857) internal successors, (443), 284 states have internal predecessors, (443), 37 states have call successors, (37), 14 states have call predecessors, (37), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 05:06:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 515 transitions. [2024-10-11 05:06:19,463 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 515 transitions. Word has length 57 [2024-10-11 05:06:19,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:19,463 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 515 transitions. [2024-10-11 05:06:19,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:06:19,464 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 515 transitions. [2024-10-11 05:06:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:06:19,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:19,466 INFO L215 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] [2024-10-11 05:06:19,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:06:19,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:19,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:19,467 INFO L85 PathProgramCache]: Analyzing trace with hash -904112064, now seen corresponding path program 1 times [2024-10-11 05:06:19,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:19,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8390038] [2024-10-11 05:06:19,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:19,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:19,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:19,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:19,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:19,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:19,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:19,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:06:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:19,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:06:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:19,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:19,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8390038] [2024-10-11 05:06:19,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8390038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:19,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:19,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:06:19,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116280187] [2024-10-11 05:06:19,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:19,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:06:19,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:19,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:06:19,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:06:19,695 INFO L87 Difference]: Start difference. First operand 332 states and 515 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:06:20,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:20,600 INFO L93 Difference]: Finished difference Result 564 states and 861 transitions. [2024-10-11 05:06:20,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:20,600 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-11 05:06:20,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:20,604 INFO L225 Difference]: With dead ends: 564 [2024-10-11 05:06:20,604 INFO L226 Difference]: Without dead ends: 470 [2024-10-11 05:06:20,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:06:20,606 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 921 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:20,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 1184 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:06:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-10-11 05:06:20,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 433. [2024-10-11 05:06:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 359 states have (on average 1.5543175487465182) internal successors, (558), 365 states have internal predecessors, (558), 50 states have call successors, (50), 21 states have call predecessors, (50), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2024-10-11 05:06:20,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 661 transitions. [2024-10-11 05:06:20,638 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 661 transitions. Word has length 57 [2024-10-11 05:06:20,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:20,639 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 661 transitions. [2024-10-11 05:06:20,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:06:20,639 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 661 transitions. [2024-10-11 05:06:20,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:06:20,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:20,641 INFO L215 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] [2024-10-11 05:06:20,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:06:20,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:20,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:20,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1024160638, now seen corresponding path program 1 times [2024-10-11 05:06:20,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:20,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402434980] [2024-10-11 05:06:20,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:20,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:20,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:20,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:20,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:20,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:20,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:20,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:06:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:20,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:06:20,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:20,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:20,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:20,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402434980] [2024-10-11 05:06:20,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402434980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:20,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:20,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:06:20,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428348309] [2024-10-11 05:06:20,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:20,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:06:20,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:20,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:06:20,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:06:20,790 INFO L87 Difference]: Start difference. First operand 433 states and 661 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:06:21,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:21,765 INFO L93 Difference]: Finished difference Result 794 states and 1190 transitions. [2024-10-11 05:06:21,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:06:21,766 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-11 05:06:21,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:21,770 INFO L225 Difference]: With dead ends: 794 [2024-10-11 05:06:21,770 INFO L226 Difference]: Without dead ends: 606 [2024-10-11 05:06:21,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-11 05:06:21,775 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 1264 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:21,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 1375 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:06:21,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-10-11 05:06:21,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 534. [2024-10-11 05:06:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 438 states have (on average 1.5342465753424657) internal successors, (672), 446 states have internal predecessors, (672), 63 states have call successors, (63), 28 states have call predecessors, (63), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) [2024-10-11 05:06:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 809 transitions. [2024-10-11 05:06:21,825 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 809 transitions. Word has length 57 [2024-10-11 05:06:21,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:21,825 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 809 transitions. [2024-10-11 05:06:21,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-11 05:06:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 809 transitions. [2024-10-11 05:06:21,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:06:21,827 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:21,827 INFO L215 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] [2024-10-11 05:06:21,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:06:21,828 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:21,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:21,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1917646976, now seen corresponding path program 1 times [2024-10-11 05:06:21,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:21,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332438803] [2024-10-11 05:06:21,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:21,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:21,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:21,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:21,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:21,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:21,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:21,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:06:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:21,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:06:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:21,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:06:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:21,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:21,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332438803] [2024-10-11 05:06:21,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332438803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:21,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:21,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:21,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301503642] [2024-10-11 05:06:21,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:21,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:21,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:21,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:21,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:21,911 INFO L87 Difference]: Start difference. First operand 534 states and 809 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:06:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:22,719 INFO L93 Difference]: Finished difference Result 1140 states and 1685 transitions. [2024-10-11 05:06:22,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:06:22,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 57 [2024-10-11 05:06:22,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:22,725 INFO L225 Difference]: With dead ends: 1140 [2024-10-11 05:06:22,725 INFO L226 Difference]: Without dead ends: 857 [2024-10-11 05:06:22,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:06:22,731 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 1108 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:22,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1254 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:06:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-10-11 05:06:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 786. [2024-10-11 05:06:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 635 states have (on average 1.4960629921259843) internal successors, (950), 647 states have internal predecessors, (950), 93 states have call successors, (93), 49 states have call predecessors, (93), 56 states have return successors, (112), 93 states have call predecessors, (112), 91 states have call successors, (112) [2024-10-11 05:06:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1155 transitions. [2024-10-11 05:06:22,780 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1155 transitions. Word has length 57 [2024-10-11 05:06:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:22,781 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1155 transitions. [2024-10-11 05:06:22,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:06:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1155 transitions. [2024-10-11 05:06:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:06:22,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:22,786 INFO L215 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] [2024-10-11 05:06:22,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:06:22,786 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:22,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:22,786 INFO L85 PathProgramCache]: Analyzing trace with hash 659776351, now seen corresponding path program 1 times [2024-10-11 05:06:22,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:22,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423635845] [2024-10-11 05:06:22,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:22,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:22,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:22,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:22,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:22,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:22,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:22,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 05:06:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:22,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:06:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:22,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:22,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:22,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423635845] [2024-10-11 05:06:22,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423635845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:22,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:22,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:06:22,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072540245] [2024-10-11 05:06:22,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:22,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:06:22,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:22,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:06:22,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:06:22,884 INFO L87 Difference]: Start difference. First operand 786 states and 1155 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:06:23,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:23,807 INFO L93 Difference]: Finished difference Result 1421 states and 2070 transitions. [2024-10-11 05:06:23,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:06:23,808 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-11 05:06:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:23,812 INFO L225 Difference]: With dead ends: 1421 [2024-10-11 05:06:23,812 INFO L226 Difference]: Without dead ends: 886 [2024-10-11 05:06:23,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:06:23,816 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 652 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:23,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 1619 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1576 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:06:23,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2024-10-11 05:06:23,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 810. [2024-10-11 05:06:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 653 states have (on average 1.4823889739663094) internal successors, (968), 665 states have internal predecessors, (968), 93 states have call successors, (93), 49 states have call predecessors, (93), 62 states have return successors, (118), 99 states have call predecessors, (118), 91 states have call successors, (118) [2024-10-11 05:06:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1179 transitions. [2024-10-11 05:06:23,869 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1179 transitions. Word has length 58 [2024-10-11 05:06:23,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:23,870 INFO L471 AbstractCegarLoop]: Abstraction has 810 states and 1179 transitions. [2024-10-11 05:06:23,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:06:23,870 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1179 transitions. [2024-10-11 05:06:23,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:06:23,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:23,872 INFO L215 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] [2024-10-11 05:06:23,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:06:23,872 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:23,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:23,873 INFO L85 PathProgramCache]: Analyzing trace with hash 519227741, now seen corresponding path program 1 times [2024-10-11 05:06:23,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:23,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876090619] [2024-10-11 05:06:23,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:23,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:23,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:23,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:23,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:23,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:23,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:23,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 05:06:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:23,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:06:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:23,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:23,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876090619] [2024-10-11 05:06:23,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876090619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:23,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:24,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:06:24,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52041325] [2024-10-11 05:06:24,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:24,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:06:24,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:24,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:06:24,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:06:24,001 INFO L87 Difference]: Start difference. First operand 810 states and 1179 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:06:24,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:24,883 INFO L93 Difference]: Finished difference Result 1442 states and 2073 transitions. [2024-10-11 05:06:24,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:06:24,884 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-11 05:06:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:24,888 INFO L225 Difference]: With dead ends: 1442 [2024-10-11 05:06:24,888 INFO L226 Difference]: Without dead ends: 883 [2024-10-11 05:06:24,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:06:24,890 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 436 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1645 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 1726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:24,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1820 Invalid, 1726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1645 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:06:24,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-10-11 05:06:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 822. [2024-10-11 05:06:24,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 662 states have (on average 1.4712990936555892) internal successors, (974), 674 states have internal predecessors, (974), 93 states have call successors, (93), 49 states have call predecessors, (93), 65 states have return successors, (121), 102 states have call predecessors, (121), 91 states have call successors, (121) [2024-10-11 05:06:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1188 transitions. [2024-10-11 05:06:24,931 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1188 transitions. Word has length 58 [2024-10-11 05:06:24,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:24,931 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1188 transitions. [2024-10-11 05:06:24,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:06:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1188 transitions. [2024-10-11 05:06:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:06:24,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:24,935 INFO L215 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] [2024-10-11 05:06:24,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:06:24,935 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:24,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:24,936 INFO L85 PathProgramCache]: Analyzing trace with hash 446841183, now seen corresponding path program 1 times [2024-10-11 05:06:24,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:24,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960577071] [2024-10-11 05:06:24,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:24,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:24,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:24,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:24,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:25,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:25,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:25,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 05:06:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:25,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:06:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:25,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:25,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:25,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960577071] [2024-10-11 05:06:25,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960577071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:25,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:25,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:06:25,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461001244] [2024-10-11 05:06:25,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:25,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:06:25,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:25,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:06:25,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:06:25,053 INFO L87 Difference]: Start difference. First operand 822 states and 1188 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:06:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:26,771 INFO L93 Difference]: Finished difference Result 2927 states and 4250 transitions. [2024-10-11 05:06:26,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 05:06:26,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 58 [2024-10-11 05:06:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:26,777 INFO L225 Difference]: With dead ends: 2927 [2024-10-11 05:06:26,777 INFO L226 Difference]: Without dead ends: 1175 [2024-10-11 05:06:26,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 05:06:26,782 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 1825 mSDsluCounter, 1505 mSDsCounter, 0 mSdLazyCounter, 2260 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1844 SdHoareTripleChecker+Valid, 1918 SdHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 2260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:26,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1844 Valid, 1918 Invalid, 2612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 2260 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:06:26,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2024-10-11 05:06:26,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1037. [2024-10-11 05:06:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 818 states have (on average 1.4205378973105134) internal successors, (1162), 834 states have internal predecessors, (1162), 123 states have call successors, (123), 70 states have call predecessors, (123), 94 states have return successors, (173), 136 states have call predecessors, (173), 121 states have call successors, (173) [2024-10-11 05:06:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1458 transitions. [2024-10-11 05:06:26,838 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1458 transitions. Word has length 58 [2024-10-11 05:06:26,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:26,839 INFO L471 AbstractCegarLoop]: Abstraction has 1037 states and 1458 transitions. [2024-10-11 05:06:26,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 6 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:06:26,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1458 transitions. [2024-10-11 05:06:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:06:26,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:26,841 INFO L215 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] [2024-10-11 05:06:26,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:06:26,841 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:26,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:26,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1077960567, now seen corresponding path program 1 times [2024-10-11 05:06:26,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:26,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995287066] [2024-10-11 05:06:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:26,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:26,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:26,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:26,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:26,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:26,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:26,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:06:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:26,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:06:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:26,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:26,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995287066] [2024-10-11 05:06:26,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995287066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:26,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:26,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:06:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362640807] [2024-10-11 05:06:26,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:26,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:06:26,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:26,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:06:26,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:06:26,978 INFO L87 Difference]: Start difference. First operand 1037 states and 1458 transitions. Second operand has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:06:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:27,788 INFO L93 Difference]: Finished difference Result 2129 states and 3007 transitions. [2024-10-11 05:06:27,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 05:06:27,788 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2024-10-11 05:06:27,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:27,791 INFO L225 Difference]: With dead ends: 2129 [2024-10-11 05:06:27,792 INFO L226 Difference]: Without dead ends: 232 [2024-10-11 05:06:27,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-11 05:06:27,796 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 1084 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:27,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 1309 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 05:06:27,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-11 05:06:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2024-10-11 05:06:27,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 204 states have (on average 1.607843137254902) internal successors, (328), 205 states have internal predecessors, (328), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 05:06:27,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 370 transitions. [2024-10-11 05:06:27,829 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 370 transitions. Word has length 59 [2024-10-11 05:06:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:27,829 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 370 transitions. [2024-10-11 05:06:27,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-11 05:06:27,830 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 370 transitions. [2024-10-11 05:06:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 05:06:27,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:27,831 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:06:27,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:06:27,831 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:27,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:27,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2042337974, now seen corresponding path program 1 times [2024-10-11 05:06:27,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:27,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789603035] [2024-10-11 05:06:27,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:27,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:27,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:27,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:27,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:06:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:27,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:06:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:27,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:06:27,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:27,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:27,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789603035] [2024-10-11 05:06:27,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789603035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:27,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:27,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:06:27,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270771764] [2024-10-11 05:06:27,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:27,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:06:27,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:27,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:06:27,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:06:27,935 INFO L87 Difference]: Start difference. First operand 232 states and 370 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:28,591 INFO L93 Difference]: Finished difference Result 539 states and 876 transitions. [2024-10-11 05:06:28,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:06:28,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 111 [2024-10-11 05:06:28,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:28,594 INFO L225 Difference]: With dead ends: 539 [2024-10-11 05:06:28,594 INFO L226 Difference]: Without dead ends: 312 [2024-10-11 05:06:28,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:06:28,595 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 622 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:28,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 417 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 05:06:28,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-10-11 05:06:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 232. [2024-10-11 05:06:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 204 states have (on average 1.6029411764705883) internal successors, (327), 205 states have internal predecessors, (327), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 05:06:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 369 transitions. [2024-10-11 05:06:28,607 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 369 transitions. Word has length 111 [2024-10-11 05:06:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:28,607 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 369 transitions. [2024-10-11 05:06:28,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:28,608 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 369 transitions. [2024-10-11 05:06:28,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 05:06:28,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:28,608 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:06:28,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:06:28,609 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:28,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:28,609 INFO L85 PathProgramCache]: Analyzing trace with hash 2134187848, now seen corresponding path program 1 times [2024-10-11 05:06:28,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:28,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625085691] [2024-10-11 05:06:28,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:28,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:28,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:28,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:28,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:06:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:28,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:06:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:28,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:06:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:28,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:28,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625085691] [2024-10-11 05:06:28,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625085691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:28,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:28,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:06:28,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433330484] [2024-10-11 05:06:28,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:28,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:06:28,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:28,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:06:28,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:06:28,750 INFO L87 Difference]: Start difference. First operand 232 states and 369 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:29,861 INFO L93 Difference]: Finished difference Result 837 states and 1365 transitions. [2024-10-11 05:06:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:06:29,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (5), 3 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 111 [2024-10-11 05:06:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:29,864 INFO L225 Difference]: With dead ends: 837 [2024-10-11 05:06:29,864 INFO L226 Difference]: Without dead ends: 619 [2024-10-11 05:06:29,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:06:29,865 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 932 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:29,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 701 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:06:29,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-10-11 05:06:29,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 460. [2024-10-11 05:06:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 409 states have (on average 1.6136919315403424) internal successors, (660), 411 states have internal predecessors, (660), 37 states have call successors, (37), 12 states have call predecessors, (37), 13 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2024-10-11 05:06:29,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 737 transitions. [2024-10-11 05:06:29,887 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 737 transitions. Word has length 111 [2024-10-11 05:06:29,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:29,887 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 737 transitions. [2024-10-11 05:06:29,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:29,888 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 737 transitions. [2024-10-11 05:06:29,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 05:06:29,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:29,889 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:06:29,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:06:29,889 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:29,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:29,889 INFO L85 PathProgramCache]: Analyzing trace with hash -881780788, now seen corresponding path program 1 times [2024-10-11 05:06:29,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:29,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342861074] [2024-10-11 05:06:29,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:29,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:29,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:29,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:30,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:06:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:30,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:06:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:30,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:06:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:30,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:30,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342861074] [2024-10-11 05:06:30,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342861074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:30,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:30,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:30,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425290028] [2024-10-11 05:06:30,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:30,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:30,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:30,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:30,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:30,037 INFO L87 Difference]: Start difference. First operand 460 states and 737 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:31,654 INFO L93 Difference]: Finished difference Result 1382 states and 2251 transitions. [2024-10-11 05:06:31,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:31,655 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 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 111 [2024-10-11 05:06:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:31,660 INFO L225 Difference]: With dead ends: 1382 [2024-10-11 05:06:31,660 INFO L226 Difference]: Without dead ends: 936 [2024-10-11 05:06:31,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:06:31,661 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 947 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:31,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 1321 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2373 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:06:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2024-10-11 05:06:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 671. [2024-10-11 05:06:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 597 states have (on average 1.6063651591289783) internal successors, (959), 600 states have internal predecessors, (959), 53 states have call successors, (53), 18 states have call predecessors, (53), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-11 05:06:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1070 transitions. [2024-10-11 05:06:31,715 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1070 transitions. Word has length 111 [2024-10-11 05:06:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:31,715 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 1070 transitions. [2024-10-11 05:06:31,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1070 transitions. [2024-10-11 05:06:31,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 05:06:31,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:31,717 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:06:31,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:06:31,718 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:31,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:31,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1794211594, now seen corresponding path program 1 times [2024-10-11 05:06:31,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:31,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659811758] [2024-10-11 05:06:31,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:31,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:31,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:31,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:31,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:06:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:31,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:06:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:31,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:06:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:31,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:31,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659811758] [2024-10-11 05:06:31,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659811758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:31,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:31,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:31,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099040304] [2024-10-11 05:06:31,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:31,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:31,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:31,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:31,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:31,882 INFO L87 Difference]: Start difference. First operand 671 states and 1070 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:33,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:33,435 INFO L93 Difference]: Finished difference Result 2180 states and 3542 transitions. [2024-10-11 05:06:33,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:33,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 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 111 [2024-10-11 05:06:33,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:33,444 INFO L225 Difference]: With dead ends: 2180 [2024-10-11 05:06:33,444 INFO L226 Difference]: Without dead ends: 1523 [2024-10-11 05:06:33,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:06:33,447 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 945 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 2422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:33,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 1319 Invalid, 2422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:06:33,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2024-10-11 05:06:33,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1094. [2024-10-11 05:06:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 974 states have (on average 1.5995893223819302) internal successors, (1558), 979 states have internal predecessors, (1558), 85 states have call successors, (85), 30 states have call predecessors, (85), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-11 05:06:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1741 transitions. [2024-10-11 05:06:33,556 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1741 transitions. Word has length 111 [2024-10-11 05:06:33,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:33,556 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1741 transitions. [2024-10-11 05:06:33,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1741 transitions. [2024-10-11 05:06:33,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 05:06:33,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:33,558 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:06:33,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:06:33,558 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:33,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:33,559 INFO L85 PathProgramCache]: Analyzing trace with hash 910702604, now seen corresponding path program 1 times [2024-10-11 05:06:33,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:33,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031411588] [2024-10-11 05:06:33,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:33,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:06:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:06:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:06:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:33,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:33,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031411588] [2024-10-11 05:06:33,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031411588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:33,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:33,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:33,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879161245] [2024-10-11 05:06:33,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:33,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:33,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:33,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:33,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:33,720 INFO L87 Difference]: Start difference. First operand 1094 states and 1741 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:35,333 INFO L93 Difference]: Finished difference Result 3711 states and 6009 transitions. [2024-10-11 05:06:35,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:35,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 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 111 [2024-10-11 05:06:35,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:35,343 INFO L225 Difference]: With dead ends: 3711 [2024-10-11 05:06:35,343 INFO L226 Difference]: Without dead ends: 2631 [2024-10-11 05:06:35,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:06:35,346 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 947 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 2355 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 2408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:35,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 1319 Invalid, 2408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2355 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:06:35,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2024-10-11 05:06:35,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 1941. [2024-10-11 05:06:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1729 states have (on average 1.593984962406015) internal successors, (2756), 1738 states have internal predecessors, (2756), 149 states have call successors, (149), 54 states have call predecessors, (149), 62 states have return successors, (184), 156 states have call predecessors, (184), 149 states have call successors, (184) [2024-10-11 05:06:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 3089 transitions. [2024-10-11 05:06:35,461 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 3089 transitions. Word has length 111 [2024-10-11 05:06:35,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:35,461 INFO L471 AbstractCegarLoop]: Abstraction has 1941 states and 3089 transitions. [2024-10-11 05:06:35,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:35,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 3089 transitions. [2024-10-11 05:06:35,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 05:06:35,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:35,463 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:06:35,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:06:35,463 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:35,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:35,464 INFO L85 PathProgramCache]: Analyzing trace with hash 882202314, now seen corresponding path program 1 times [2024-10-11 05:06:35,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:35,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364455850] [2024-10-11 05:06:35,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:35,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:35,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:35,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:35,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:06:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:35,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:06:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:35,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:06:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:35,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:35,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:35,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364455850] [2024-10-11 05:06:35,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364455850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:35,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:35,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:35,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755482657] [2024-10-11 05:06:35,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:35,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:35,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:35,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:35,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:35,607 INFO L87 Difference]: Start difference. First operand 1941 states and 3089 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:37,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:37,331 INFO L93 Difference]: Finished difference Result 6765 states and 10947 transitions. [2024-10-11 05:06:37,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:37,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 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 111 [2024-10-11 05:06:37,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:37,349 INFO L225 Difference]: With dead ends: 6765 [2024-10-11 05:06:37,349 INFO L226 Difference]: Without dead ends: 4838 [2024-10-11 05:06:37,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:06:37,355 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 943 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:37,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1319 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2327 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:06:37,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4838 states. [2024-10-11 05:06:37,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4838 to 3649. [2024-10-11 05:06:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3649 states, 3253 states have (on average 1.5911466338764217) internal successors, (5176), 3270 states have internal predecessors, (5176), 277 states have call successors, (277), 102 states have call predecessors, (277), 118 states have return successors, (374), 292 states have call predecessors, (374), 277 states have call successors, (374) [2024-10-11 05:06:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 5827 transitions. [2024-10-11 05:06:37,588 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 5827 transitions. Word has length 111 [2024-10-11 05:06:37,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:37,589 INFO L471 AbstractCegarLoop]: Abstraction has 3649 states and 5827 transitions. [2024-10-11 05:06:37,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:37,589 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 5827 transitions. [2024-10-11 05:06:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 05:06:37,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:37,592 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:06:37,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:06:37,592 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:37,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:37,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1535701752, now seen corresponding path program 1 times [2024-10-11 05:06:37,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:37,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165883650] [2024-10-11 05:06:37,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:37,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:37,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:37,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:37,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:06:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:37,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:06:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:37,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:06:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:37,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:37,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165883650] [2024-10-11 05:06:37,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165883650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:37,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:37,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:37,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544002639] [2024-10-11 05:06:37,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:37,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:37,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:37,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:37,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:37,749 INFO L87 Difference]: Start difference. First operand 3649 states and 5827 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:39,492 INFO L93 Difference]: Finished difference Result 12891 states and 20915 transitions. [2024-10-11 05:06:39,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:39,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 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 111 [2024-10-11 05:06:39,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:39,528 INFO L225 Difference]: With dead ends: 12891 [2024-10-11 05:06:39,528 INFO L226 Difference]: Without dead ends: 9256 [2024-10-11 05:06:39,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:06:39,540 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1010 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:39,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1024 Valid, 870 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:06:39,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9256 states. [2024-10-11 05:06:39,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9256 to 7078. [2024-10-11 05:06:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7078 states, 6314 states have (on average 1.5891669306303453) internal successors, (10034), 6347 states have internal predecessors, (10034), 533 states have call successors, (533), 198 states have call predecessors, (533), 230 states have return successors, (808), 564 states have call predecessors, (808), 533 states have call successors, (808) [2024-10-11 05:06:39,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7078 states to 7078 states and 11375 transitions. [2024-10-11 05:06:40,002 INFO L78 Accepts]: Start accepts. Automaton has 7078 states and 11375 transitions. Word has length 111 [2024-10-11 05:06:40,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:40,002 INFO L471 AbstractCegarLoop]: Abstraction has 7078 states and 11375 transitions. [2024-10-11 05:06:40,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:40,003 INFO L276 IsEmpty]: Start isEmpty. Operand 7078 states and 11375 transitions. [2024-10-11 05:06:40,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 05:06:40,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:40,008 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:06:40,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:06:40,008 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:40,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:40,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1988531978, now seen corresponding path program 1 times [2024-10-11 05:06:40,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:40,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338026522] [2024-10-11 05:06:40,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:40,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:40,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:40,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:06:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:06:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:40,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:06:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:40,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:40,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338026522] [2024-10-11 05:06:40,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338026522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:40,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:40,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:40,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56192942] [2024-10-11 05:06:40,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:40,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:40,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:40,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:40,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:40,145 INFO L87 Difference]: Start difference. First operand 7078 states and 11375 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:42,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:42,495 INFO L93 Difference]: Finished difference Result 25142 states and 41041 transitions. [2024-10-11 05:06:42,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:42,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 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 111 [2024-10-11 05:06:42,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:42,562 INFO L225 Difference]: With dead ends: 25142 [2024-10-11 05:06:42,566 INFO L226 Difference]: Without dead ends: 18078 [2024-10-11 05:06:42,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:06:42,629 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 941 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 2301 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 2354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:42,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 1319 Invalid, 2354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2301 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:06:42,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18078 states. [2024-10-11 05:06:43,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18078 to 13967. [2024-10-11 05:06:43,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13967 states, 12467 states have (on average 1.587871982032566) internal successors, (19796), 12532 states have internal predecessors, (19796), 1045 states have call successors, (1045), 390 states have call predecessors, (1045), 454 states have return successors, (1838), 1108 states have call predecessors, (1838), 1045 states have call successors, (1838) [2024-10-11 05:06:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13967 states to 13967 states and 22679 transitions. [2024-10-11 05:06:43,515 INFO L78 Accepts]: Start accepts. Automaton has 13967 states and 22679 transitions. Word has length 111 [2024-10-11 05:06:43,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:43,516 INFO L471 AbstractCegarLoop]: Abstraction has 13967 states and 22679 transitions. [2024-10-11 05:06:43,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:43,516 INFO L276 IsEmpty]: Start isEmpty. Operand 13967 states and 22679 transitions. [2024-10-11 05:06:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 05:06:43,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:43,525 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:06:43,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:06:43,526 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:43,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash 993838280, now seen corresponding path program 1 times [2024-10-11 05:06:43,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:43,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797362107] [2024-10-11 05:06:43,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:43,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:43,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:43,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:43,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:06:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:43,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:06:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:43,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:06:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:43,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:43,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:43,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797362107] [2024-10-11 05:06:43,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797362107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:43,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:43,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:43,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124449540] [2024-10-11 05:06:43,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:43,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:43,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:43,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:43,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:43,655 INFO L87 Difference]: Start difference. First operand 13967 states and 22679 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:47,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:47,589 INFO L93 Difference]: Finished difference Result 55533 states and 91305 transitions. [2024-10-11 05:06:47,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:06:47,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 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 111 [2024-10-11 05:06:47,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:47,712 INFO L225 Difference]: With dead ends: 55533 [2024-10-11 05:06:47,713 INFO L226 Difference]: Without dead ends: 41580 [2024-10-11 05:06:47,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:06:47,753 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 1005 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 2712 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:47,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 1312 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2712 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 05:06:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41580 states. [2024-10-11 05:06:50,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41580 to 27680. [2024-10-11 05:06:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27680 states, 24772 states have (on average 1.5884870014532537) internal successors, (39350), 24901 states have internal predecessors, (39350), 2005 states have call successors, (2005), 774 states have call predecessors, (2005), 902 states have return successors, (4320), 2132 states have call predecessors, (4320), 2005 states have call successors, (4320) [2024-10-11 05:06:50,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27680 states to 27680 states and 45675 transitions. [2024-10-11 05:06:50,136 INFO L78 Accepts]: Start accepts. Automaton has 27680 states and 45675 transitions. Word has length 111 [2024-10-11 05:06:50,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:50,137 INFO L471 AbstractCegarLoop]: Abstraction has 27680 states and 45675 transitions. [2024-10-11 05:06:50,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:50,137 INFO L276 IsEmpty]: Start isEmpty. Operand 27680 states and 45675 transitions. [2024-10-11 05:06:50,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 05:06:50,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:50,160 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:06:50,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 05:06:50,160 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:50,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:50,161 INFO L85 PathProgramCache]: Analyzing trace with hash 407562058, now seen corresponding path program 1 times [2024-10-11 05:06:50,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:50,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574871428] [2024-10-11 05:06:50,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:50,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:50,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:50,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:50,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:06:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:50,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:06:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:50,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:06:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:06:50,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:50,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574871428] [2024-10-11 05:06:50,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574871428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:50,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:50,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:50,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585661901] [2024-10-11 05:06:50,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:50,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:50,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:50,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:50,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:50,291 INFO L87 Difference]: Start difference. First operand 27680 states and 45675 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:56,632 INFO L93 Difference]: Finished difference Result 108636 states and 181391 transitions. [2024-10-11 05:06:56,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:06:56,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 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 111 [2024-10-11 05:06:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:56,893 INFO L225 Difference]: With dead ends: 108636 [2024-10-11 05:06:56,893 INFO L226 Difference]: Without dead ends: 80970 [2024-10-11 05:06:56,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:06:56,977 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 1162 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 1308 SdHoareTripleChecker+Invalid, 2320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:56,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 1308 Invalid, 2320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 05:06:57,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80970 states. [2024-10-11 05:07:01,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80970 to 54465. [2024-10-11 05:07:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54465 states, 48805 states have (on average 1.589181436328245) internal successors, (77560), 49062 states have internal predecessors, (77560), 3861 states have call successors, (3861), 1542 states have call predecessors, (3861), 1798 states have return successors, (10678), 4116 states have call predecessors, (10678), 3861 states have call successors, (10678) [2024-10-11 05:07:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54465 states to 54465 states and 92099 transitions. [2024-10-11 05:07:01,303 INFO L78 Accepts]: Start accepts. Automaton has 54465 states and 92099 transitions. Word has length 111 [2024-10-11 05:07:01,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:07:01,303 INFO L471 AbstractCegarLoop]: Abstraction has 54465 states and 92099 transitions. [2024-10-11 05:07:01,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:01,304 INFO L276 IsEmpty]: Start isEmpty. Operand 54465 states and 92099 transitions. [2024-10-11 05:07:01,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 05:07:01,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:07:01,339 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:07:01,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 05:07:01,339 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:07:01,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:07:01,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1551012728, now seen corresponding path program 1 times [2024-10-11 05:07:01,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:07:01,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045069992] [2024-10-11 05:07:01,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:07:01,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:07:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:01,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:07:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:01,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:07:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:01,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 05:07:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:01,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 05:07:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:01,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 05:07:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:07:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:07:01,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:07:01,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045069992] [2024-10-11 05:07:01,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045069992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:07:01,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:07:01,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:07:01,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778426546] [2024-10-11 05:07:01,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:07:01,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:07:01,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:07:01,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:07:01,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:07:01,492 INFO L87 Difference]: Start difference. First operand 54465 states and 92099 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:07:11,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:07:11,418 INFO L93 Difference]: Finished difference Result 211131 states and 360997 transitions. [2024-10-11 05:07:11,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:07:11,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (5), 3 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 111 [2024-10-11 05:07:11,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:07:12,230 INFO L225 Difference]: With dead ends: 211131 [2024-10-11 05:07:12,230 INFO L226 Difference]: Without dead ends: 156680 [2024-10-11 05:07:12,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:07:12,509 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 985 mSDsluCounter, 1003 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 998 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 2658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 05:07:12,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [998 Valid, 1312 Invalid, 2658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 05:07:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156680 states.