./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.03.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.03.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 bad4bd14ff0d6303c86b61698001b4d4d1f47b3200dad5c7d05f11b8899f8627 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:05:49,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:05:49,439 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:05:49,443 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:05:49,444 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:05:49,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:05:49,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:05:49,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:05:49,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:05:49,478 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:05:49,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:05:49,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:05:49,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:05:49,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:05:49,481 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:05:49,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:05:49,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:05:49,482 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 05:05:49,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:05:49,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 05:05:49,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:05:49,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:05:49,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:05:49,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:05:49,488 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:05:49,488 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 05:05:49,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:05:49,489 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:05:49,489 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:05:49,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:05:49,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:05:49,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:05:49,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:05:49,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:05:49,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:05:49,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:05:49,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:05:49,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:05:49,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:05:49,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:05:49,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:05:49,494 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:05:49,494 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 -> bad4bd14ff0d6303c86b61698001b4d4d1f47b3200dad5c7d05f11b8899f8627 [2024-10-11 05:05:49,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:05:49,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:05:49,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:05:49,797 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:05:49,797 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:05:49,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c [2024-10-11 05:05:51,311 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:05:51,575 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:05:51,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.03.cil-1.c [2024-10-11 05:05:51,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a3e44f55b/13aebcca2b3f461d9fec17c5f6331633/FLAG4002b4fa7 [2024-10-11 05:05:51,615 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a3e44f55b/13aebcca2b3f461d9fec17c5f6331633 [2024-10-11 05:05:51,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:05:51,620 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:05:51,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:05:51,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:05:51,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:05:51,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:05:51" (1/1) ... [2024-10-11 05:05:51,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a96573b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:51, skipping insertion in model container [2024-10-11 05:05:51,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:05:51" (1/1) ... [2024-10-11 05:05:51,680 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:05:51,868 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.03.cil-1.c[911,924] [2024-10-11 05:05:51,946 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.03.cil-1.c[8416,8429] [2024-10-11 05:05:51,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:05:52,002 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:05:52,016 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.03.cil-1.c[911,924] [2024-10-11 05:05:52,039 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.03.cil-1.c[8416,8429] [2024-10-11 05:05:52,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:05:52,086 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:05:52,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:52 WrapperNode [2024-10-11 05:05:52,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:05:52,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:05:52,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:05:52,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:05:52,095 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:05:52" (1/1) ... [2024-10-11 05:05:52,105 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:05:52" (1/1) ... [2024-10-11 05:05:52,148 INFO L138 Inliner]: procedures = 61, calls = 71, calls flagged for inlining = 29, calls inlined = 29, statements flattened = 572 [2024-10-11 05:05:52,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:05:52,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:05:52,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:05:52,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:05:52,158 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:52" (1/1) ... [2024-10-11 05:05:52,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:52" (1/1) ... [2024-10-11 05:05:52,163 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:52" (1/1) ... [2024-10-11 05:05:52,184 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:05:52,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:52" (1/1) ... [2024-10-11 05:05:52,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:52" (1/1) ... [2024-10-11 05:05:52,196 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:52" (1/1) ... [2024-10-11 05:05:52,206 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:52" (1/1) ... [2024-10-11 05:05:52,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:52" (1/1) ... [2024-10-11 05:05:52,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:52" (1/1) ... [2024-10-11 05:05:52,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:05:52,217 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:05:52,217 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:05:52,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:05:52,218 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:52" (1/1) ... [2024-10-11 05:05:52,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:05:52,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:05:52,262 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:05:52,267 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:05:52,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:05:52,318 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 05:05:52,318 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 05:05:52,318 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-11 05:05:52,320 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-11 05:05:52,320 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-11 05:05:52,320 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-11 05:05:52,320 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-11 05:05:52,320 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-11 05:05:52,320 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-11 05:05:52,321 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-11 05:05:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-11 05:05:52,321 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-11 05:05:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-11 05:05:52,321 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-11 05:05:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-11 05:05:52,321 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-11 05:05:52,321 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-11 05:05:52,321 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-11 05:05:52,339 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-11 05:05:52,340 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-11 05:05:52,341 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-11 05:05:52,341 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-11 05:05:52,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:05:52,342 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-11 05:05:52,343 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-11 05:05:52,343 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-11 05:05:52,348 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-11 05:05:52,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:05:52,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:05:52,348 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-11 05:05:52,349 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-11 05:05:52,349 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-11 05:05:52,349 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-11 05:05:52,499 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:05:52,506 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:05:53,071 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-10-11 05:05:53,075 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:05:53,180 INFO L? ?]: Removed 80 outVars from TransFormulas that were not future-live. [2024-10-11 05:05:53,181 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:05:53,250 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:05:53,252 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-11 05:05:53,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:05:53 BoogieIcfgContainer [2024-10-11 05:05:53,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:05:53,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:05:53,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:05:53,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:05:53,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:05:51" (1/3) ... [2024-10-11 05:05:53,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a80e438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:05:53, skipping insertion in model container [2024-10-11 05:05:53,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:05:52" (2/3) ... [2024-10-11 05:05:53,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a80e438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:05:53, skipping insertion in model container [2024-10-11 05:05:53,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:05:53" (3/3) ... [2024-10-11 05:05:53,262 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.03.cil-1.c [2024-10-11 05:05:53,279 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:05:53,279 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 05:05:53,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:05:53,365 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;@73634c8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:05:53,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 05:05:53,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 253 states, 200 states have (on average 1.665) internal successors, (333), 208 states have internal predecessors, (333), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 05:05:53,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:05:53,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:53,384 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:05:53,386 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:53,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:53,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1814177712, now seen corresponding path program 1 times [2024-10-11 05:05:53,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:53,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425214563] [2024-10-11 05:05:53,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:53,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:53,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:53,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:53,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:53,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:53,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:53,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:54,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:54,011 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:05:54,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:54,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425214563] [2024-10-11 05:05:54,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425214563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:54,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:54,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:05:54,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230625065] [2024-10-11 05:05:54,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:54,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:05:54,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:54,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:05:54,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:05:54,058 INFO L87 Difference]: Start difference. First operand has 253 states, 200 states have (on average 1.665) internal successors, (333), 208 states have internal predecessors, (333), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) 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:05:55,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:55,352 INFO L93 Difference]: Finished difference Result 627 states and 1001 transitions. [2024-10-11 05:05:55,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:05:55,355 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:05:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:55,372 INFO L225 Difference]: With dead ends: 627 [2024-10-11 05:05:55,374 INFO L226 Difference]: Without dead ends: 385 [2024-10-11 05:05:55,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:05:55,384 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 698 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:55,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 992 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:05:55,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-11 05:05:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 348. [2024-10-11 05:05:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 276 states have (on average 1.5289855072463767) internal successors, (422), 283 states have internal predecessors, (422), 48 states have call successors, (48), 22 states have call predecessors, (48), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2024-10-11 05:05:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 519 transitions. [2024-10-11 05:05:55,506 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 519 transitions. Word has length 57 [2024-10-11 05:05:55,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:55,507 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 519 transitions. [2024-10-11 05:05:55,507 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:05:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 519 transitions. [2024-10-11 05:05:55,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:05:55,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:55,511 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:05:55,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:05:55,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:55,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:55,514 INFO L85 PathProgramCache]: Analyzing trace with hash 536796816, now seen corresponding path program 1 times [2024-10-11 05:05:55,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:55,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283974002] [2024-10-11 05:05:55,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:55,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:55,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:55,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:55,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:55,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:55,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:55,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:55,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:55,793 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:05:55,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:55,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283974002] [2024-10-11 05:05:55,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283974002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:55,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:55,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:05:55,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508770744] [2024-10-11 05:05:55,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:55,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:05:55,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:55,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:05:55,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:05:55,804 INFO L87 Difference]: Start difference. First operand 348 states and 519 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:05:56,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:56,944 INFO L93 Difference]: Finished difference Result 709 states and 1049 transitions. [2024-10-11 05:05:56,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 05:05:56,944 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:05:56,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:56,949 INFO L225 Difference]: With dead ends: 709 [2024-10-11 05:05:56,949 INFO L226 Difference]: Without dead ends: 521 [2024-10-11 05:05:56,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-11 05:05:56,952 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 876 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 1356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:56,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 1103 Invalid, 1356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:05:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2024-10-11 05:05:57,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 449. [2024-10-11 05:05:57,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 355 states have (on average 1.5126760563380282) internal successors, (537), 364 states have internal predecessors, (537), 61 states have call successors, (61), 29 states have call predecessors, (61), 31 states have return successors, (70), 59 states have call predecessors, (70), 57 states have call successors, (70) [2024-10-11 05:05:57,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 668 transitions. [2024-10-11 05:05:57,022 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 668 transitions. Word has length 57 [2024-10-11 05:05:57,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:57,023 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 668 transitions. [2024-10-11 05:05:57,023 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:05:57,024 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 668 transitions. [2024-10-11 05:05:57,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 05:05:57,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:57,029 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:05:57,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:05:57,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:57,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:57,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1430283154, now seen corresponding path program 1 times [2024-10-11 05:05:57,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:57,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601088653] [2024-10-11 05:05:57,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:57,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:57,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:57,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:57,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:57,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:57,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 05:05:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:57,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 05:05:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:57,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 05:05:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:57,162 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:05:57,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:57,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601088653] [2024-10-11 05:05:57,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601088653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:57,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:57,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:05:57,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847951223] [2024-10-11 05:05:57,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:57,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:05:57,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:57,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:05:57,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:05:57,165 INFO L87 Difference]: Start difference. First operand 449 states and 668 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:05:58,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:58,008 INFO L93 Difference]: Finished difference Result 1055 states and 1544 transitions. [2024-10-11 05:05:58,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 05:05:58,009 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:05:58,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:58,015 INFO L225 Difference]: With dead ends: 1055 [2024-10-11 05:05:58,015 INFO L226 Difference]: Without dead ends: 772 [2024-10-11 05:05:58,016 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:05:58,017 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 980 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:58,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 798 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:05:58,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-10-11 05:05:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 701. [2024-10-11 05:05:58,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 552 states have (on average 1.4764492753623188) internal successors, (815), 565 states have internal predecessors, (815), 91 states have call successors, (91), 50 states have call predecessors, (91), 56 states have return successors, (108), 89 states have call predecessors, (108), 87 states have call successors, (108) [2024-10-11 05:05:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1014 transitions. [2024-10-11 05:05:58,081 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1014 transitions. Word has length 57 [2024-10-11 05:05:58,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:58,081 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 1014 transitions. [2024-10-11 05:05:58,082 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:05:58,082 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1014 transitions. [2024-10-11 05:05:58,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:05:58,084 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:58,084 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:05:58,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:05:58,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:58,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:58,086 INFO L85 PathProgramCache]: Analyzing trace with hash -670053475, now seen corresponding path program 1 times [2024-10-11 05:05:58,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:58,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838605219] [2024-10-11 05:05:58,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:58,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:58,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:58,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:58,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:58,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:58,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:58,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 05:05:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:58,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:05:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:58,296 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:05:58,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:58,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838605219] [2024-10-11 05:05:58,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838605219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:58,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:58,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:05:58,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546668344] [2024-10-11 05:05:58,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:58,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:05:58,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:58,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:05:58,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:05:58,299 INFO L87 Difference]: Start difference. First operand 701 states and 1014 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:05:59,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:05:59,182 INFO L93 Difference]: Finished difference Result 1303 states and 1875 transitions. [2024-10-11 05:05:59,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:05:59,182 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:05:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:05:59,187 INFO L225 Difference]: With dead ends: 1303 [2024-10-11 05:05:59,187 INFO L226 Difference]: Without dead ends: 768 [2024-10-11 05:05:59,189 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:05:59,190 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 286 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:05:59,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1374 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:05:59,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-10-11 05:05:59,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 713. [2024-10-11 05:05:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 561 states have (on average 1.463458110516934) internal successors, (821), 574 states have internal predecessors, (821), 91 states have call successors, (91), 50 states have call predecessors, (91), 59 states have return successors, (111), 92 states have call predecessors, (111), 87 states have call successors, (111) [2024-10-11 05:05:59,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1023 transitions. [2024-10-11 05:05:59,288 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1023 transitions. Word has length 58 [2024-10-11 05:05:59,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:05:59,289 INFO L471 AbstractCegarLoop]: Abstraction has 713 states and 1023 transitions. [2024-10-11 05:05:59,290 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:05:59,290 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1023 transitions. [2024-10-11 05:05:59,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 05:05:59,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:05:59,292 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:05:59,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:05:59,293 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:05:59,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:05:59,294 INFO L85 PathProgramCache]: Analyzing trace with hash -742440033, now seen corresponding path program 1 times [2024-10-11 05:05:59,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:05:59,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433516321] [2024-10-11 05:05:59,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:05:59,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:05:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:59,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:05:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:59,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:59,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:05:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:59,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:05:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:59,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:05:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:59,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 05:05:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:59,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 05:05:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:05:59,504 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:05:59,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:05:59,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433516321] [2024-10-11 05:05:59,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433516321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:05:59,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:05:59,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:05:59,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197119273] [2024-10-11 05:05:59,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:05:59,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:05:59,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:05:59,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:05:59,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:05:59,509 INFO L87 Difference]: Start difference. First operand 713 states and 1023 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:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:01,439 INFO L93 Difference]: Finished difference Result 2712 states and 3938 transitions. [2024-10-11 05:06:01,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 05:06:01,440 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:01,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:01,447 INFO L225 Difference]: With dead ends: 2712 [2024-10-11 05:06:01,447 INFO L226 Difference]: Without dead ends: 1046 [2024-10-11 05:06:01,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 05:06:01,453 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 1657 mSDsluCounter, 951 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1674 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:01,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1674 Valid, 1304 Invalid, 2020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 05:06:01,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2024-10-11 05:06:01,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 916. [2024-10-11 05:06:01,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 708 states have (on average 1.4124293785310735) internal successors, (1000), 725 states have internal predecessors, (1000), 121 states have call successors, (121), 71 states have call predecessors, (121), 85 states have return successors, (160), 123 states have call predecessors, (160), 117 states have call successors, (160) [2024-10-11 05:06:01,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1281 transitions. [2024-10-11 05:06:01,521 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1281 transitions. Word has length 58 [2024-10-11 05:06:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:01,523 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1281 transitions. [2024-10-11 05:06:01,523 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:01,523 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1281 transitions. [2024-10-11 05:06:01,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 05:06:01,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:01,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] [2024-10-11 05:06:01,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:06:01,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:01,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:01,526 INFO L85 PathProgramCache]: Analyzing trace with hash 583761357, now seen corresponding path program 1 times [2024-10-11 05:06:01,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:01,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780555136] [2024-10-11 05:06:01,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:01,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:01,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:01,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:01,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-11 05:06:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:01,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 05:06:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:01,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 05:06:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:01,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 05:06:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:01,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 05:06:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:01,707 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:01,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:01,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780555136] [2024-10-11 05:06:01,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780555136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:01,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:01,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 05:06:01,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003086067] [2024-10-11 05:06:01,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:01,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:06:01,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:01,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:06:01,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:06:01,710 INFO L87 Difference]: Start difference. First operand 916 states and 1281 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:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:02,633 INFO L93 Difference]: Finished difference Result 2008 states and 2813 transitions. [2024-10-11 05:06:02,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 05:06:02,634 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:02,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:02,637 INFO L225 Difference]: With dead ends: 2008 [2024-10-11 05:06:02,637 INFO L226 Difference]: Without dead ends: 147 [2024-10-11 05:06:02,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-11 05:06:02,642 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 1030 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:02,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1067 Valid, 981 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:06:02,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-11 05:06:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-10-11 05:06:02,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 121 states have (on average 1.5702479338842976) internal successors, (190), 123 states have internal predecessors, (190), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 05:06:02,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 226 transitions. [2024-10-11 05:06:02,671 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 226 transitions. Word has length 59 [2024-10-11 05:06:02,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:02,674 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 226 transitions. [2024-10-11 05:06:02,674 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:02,674 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 226 transitions. [2024-10-11 05:06:02,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 05:06:02,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:02,675 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] [2024-10-11 05:06:02,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:06:02,676 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:02,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:02,678 INFO L85 PathProgramCache]: Analyzing trace with hash 12662761, now seen corresponding path program 1 times [2024-10-11 05:06:02,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:02,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958657448] [2024-10-11 05:06:02,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:02,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:02,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:02,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:06:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:02,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:06:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:02,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:06:02,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:02,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:06:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:02,766 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:02,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:02,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958657448] [2024-10-11 05:06:02,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958657448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:02,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:02,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:06:02,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513027296] [2024-10-11 05:06:02,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:02,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 05:06:02,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:02,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 05:06:02,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 05:06:02,769 INFO L87 Difference]: Start difference. First operand 147 states and 226 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:03,231 INFO L93 Difference]: Finished difference Result 327 states and 512 transitions. [2024-10-11 05:06:03,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:06:03,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 05:06:03,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:03,234 INFO L225 Difference]: With dead ends: 327 [2024-10-11 05:06:03,234 INFO L226 Difference]: Without dead ends: 187 [2024-10-11 05:06:03,234 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:03,237 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 350 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:03,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 282 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:06:03,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-11 05:06:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 147. [2024-10-11 05:06:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 121 states have (on average 1.56198347107438) internal successors, (189), 123 states have internal predecessors, (189), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 05:06:03,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 225 transitions. [2024-10-11 05:06:03,251 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 225 transitions. Word has length 72 [2024-10-11 05:06:03,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:03,252 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 225 transitions. [2024-10-11 05:06:03,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 225 transitions. [2024-10-11 05:06:03,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 05:06:03,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:03,253 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] [2024-10-11 05:06:03,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 05:06:03,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:03,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:03,254 INFO L85 PathProgramCache]: Analyzing trace with hash 67055659, now seen corresponding path program 1 times [2024-10-11 05:06:03,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:03,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662555565] [2024-10-11 05:06:03,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:03,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:03,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:03,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:06:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:03,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:06:03,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:03,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:06:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:03,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:06:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:03,404 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:03,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:03,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662555565] [2024-10-11 05:06:03,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662555565] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:03,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:03,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:06:03,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739550036] [2024-10-11 05:06:03,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:03,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:06:03,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:03,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:06:03,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:06:03,407 INFO L87 Difference]: Start difference. First operand 147 states and 225 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:04,287 INFO L93 Difference]: Finished difference Result 502 states and 789 transitions. [2024-10-11 05:06:04,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 05:06:04,288 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 05:06:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:04,291 INFO L225 Difference]: With dead ends: 502 [2024-10-11 05:06:04,292 INFO L226 Difference]: Without dead ends: 365 [2024-10-11 05:06:04,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 05:06:04,293 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 512 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:04,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 470 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 05:06:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-11 05:06:04,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 284. [2024-10-11 05:06:04,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 239 states have (on average 1.5732217573221758) internal successors, (376), 242 states have internal predecessors, (376), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (32), 29 states have call predecessors, (32), 29 states have call successors, (32) [2024-10-11 05:06:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 439 transitions. [2024-10-11 05:06:04,331 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 439 transitions. Word has length 72 [2024-10-11 05:06:04,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:04,331 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 439 transitions. [2024-10-11 05:06:04,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:04,332 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 439 transitions. [2024-10-11 05:06:04,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 05:06:04,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:04,333 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] [2024-10-11 05:06:04,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 05:06:04,334 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:04,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:04,334 INFO L85 PathProgramCache]: Analyzing trace with hash 330919207, now seen corresponding path program 1 times [2024-10-11 05:06:04,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:04,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456519323] [2024-10-11 05:06:04,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:04,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:04,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:04,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:06:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:04,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:06:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:04,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:06:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:04,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:06:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:04,472 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:04,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:04,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456519323] [2024-10-11 05:06:04,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456519323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:04,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:04,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:04,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902703262] [2024-10-11 05:06:04,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:04,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:04,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:04,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:04,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:04,474 INFO L87 Difference]: Start difference. First operand 284 states and 439 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:05,709 INFO L93 Difference]: Finished difference Result 817 states and 1279 transitions. [2024-10-11 05:06:05,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:05,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 05:06:05,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:05,714 INFO L225 Difference]: With dead ends: 817 [2024-10-11 05:06:05,714 INFO L226 Difference]: Without dead ends: 543 [2024-10-11 05:06:05,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:06:05,717 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 509 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:05,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 886 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:06:05,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-10-11 05:06:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 412. [2024-10-11 05:06:05,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 348 states have (on average 1.5660919540229885) internal successors, (545), 352 states have internal predecessors, (545), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (46), 42 states have call predecessors, (46), 41 states have call successors, (46) [2024-10-11 05:06:05,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 634 transitions. [2024-10-11 05:06:05,754 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 634 transitions. Word has length 72 [2024-10-11 05:06:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:05,756 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 634 transitions. [2024-10-11 05:06:05,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 634 transitions. [2024-10-11 05:06:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 05:06:05,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:05,757 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] [2024-10-11 05:06:05,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 05:06:05,758 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:05,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash 891618985, now seen corresponding path program 1 times [2024-10-11 05:06:05,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:05,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185051748] [2024-10-11 05:06:05,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:05,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:06:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:06:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:06:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:06:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:05,888 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:05,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:05,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185051748] [2024-10-11 05:06:05,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185051748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:05,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:05,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:05,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030828164] [2024-10-11 05:06:05,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:05,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:05,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:05,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:05,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:05,891 INFO L87 Difference]: Start difference. First operand 412 states and 634 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:07,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:07,107 INFO L93 Difference]: Finished difference Result 1278 states and 1996 transitions. [2024-10-11 05:06:07,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:07,107 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 05:06:07,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:07,113 INFO L225 Difference]: With dead ends: 1278 [2024-10-11 05:06:07,113 INFO L226 Difference]: Without dead ends: 876 [2024-10-11 05:06:07,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:06:07,115 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 507 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:07,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 884 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:06:07,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-10-11 05:06:07,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 669. [2024-10-11 05:06:07,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 567 states have (on average 1.5590828924162257) internal successors, (884), 573 states have internal predecessors, (884), 67 states have call successors, (67), 31 states have call predecessors, (67), 34 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-10-11 05:06:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1029 transitions. [2024-10-11 05:06:07,175 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1029 transitions. Word has length 72 [2024-10-11 05:06:07,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:07,176 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 1029 transitions. [2024-10-11 05:06:07,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:07,176 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1029 transitions. [2024-10-11 05:06:07,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 05:06:07,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:07,178 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] [2024-10-11 05:06:07,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 05:06:07,178 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:07,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:07,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1325348071, now seen corresponding path program 1 times [2024-10-11 05:06:07,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:07,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496528269] [2024-10-11 05:06:07,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:07,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:06:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:06:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:06:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:06:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:07,312 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:07,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:07,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496528269] [2024-10-11 05:06:07,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496528269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:07,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:07,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:07,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299425133] [2024-10-11 05:06:07,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:07,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:07,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:07,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:07,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:07,315 INFO L87 Difference]: Start difference. First operand 669 states and 1029 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:08,471 INFO L93 Difference]: Finished difference Result 2167 states and 3379 transitions. [2024-10-11 05:06:08,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 05:06:08,472 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 05:06:08,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:08,480 INFO L225 Difference]: With dead ends: 2167 [2024-10-11 05:06:08,481 INFO L226 Difference]: Without dead ends: 1508 [2024-10-11 05:06:08,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 05:06:08,484 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 503 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:08,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 884 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:06:08,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2024-10-11 05:06:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1184. [2024-10-11 05:06:08,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1006 states have (on average 1.5526838966202783) internal successors, (1562), 1016 states have internal predecessors, (1562), 115 states have call successors, (115), 55 states have call predecessors, (115), 62 states have return successors, (148), 120 states have call predecessors, (148), 113 states have call successors, (148) [2024-10-11 05:06:08,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1825 transitions. [2024-10-11 05:06:08,591 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1825 transitions. Word has length 72 [2024-10-11 05:06:08,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:08,592 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1825 transitions. [2024-10-11 05:06:08,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:08,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1825 transitions. [2024-10-11 05:06:08,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 05:06:08,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:08,594 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] [2024-10-11 05:06:08,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 05:06:08,594 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:08,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:08,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1708701975, now seen corresponding path program 1 times [2024-10-11 05:06:08,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:08,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707085033] [2024-10-11 05:06:08,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:08,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:08,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:08,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:06:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:08,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:06:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:08,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:06:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:08,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:06:08,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:08,764 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:08,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:08,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707085033] [2024-10-11 05:06:08,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707085033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:08,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:08,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:08,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35943125] [2024-10-11 05:06:08,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:08,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:08,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:08,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:08,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:08,767 INFO L87 Difference]: Start difference. First operand 1184 states and 1825 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:10,161 INFO L93 Difference]: Finished difference Result 4296 states and 6699 transitions. [2024-10-11 05:06:10,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:06:10,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 05:06:10,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:10,178 INFO L225 Difference]: With dead ends: 4296 [2024-10-11 05:06:10,178 INFO L226 Difference]: Without dead ends: 3122 [2024-10-11 05:06:10,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:06:10,183 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 528 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:10,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 877 Invalid, 1529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 05:06:10,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2024-10-11 05:06:10,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 2203. [2024-10-11 05:06:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2203 states, 1881 states have (on average 1.5502392344497609) internal successors, (2916), 1899 states have internal predecessors, (2916), 203 states have call successors, (203), 103 states have call predecessors, (203), 118 states have return successors, (298), 216 states have call predecessors, (298), 201 states have call successors, (298) [2024-10-11 05:06:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2203 states to 2203 states and 3417 transitions. [2024-10-11 05:06:10,426 INFO L78 Accepts]: Start accepts. Automaton has 2203 states and 3417 transitions. Word has length 72 [2024-10-11 05:06:10,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:10,426 INFO L471 AbstractCegarLoop]: Abstraction has 2203 states and 3417 transitions. [2024-10-11 05:06:10,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:10,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2203 states and 3417 transitions. [2024-10-11 05:06:10,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 05:06:10,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:10,430 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] [2024-10-11 05:06:10,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 05:06:10,431 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:10,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:10,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1668027225, now seen corresponding path program 1 times [2024-10-11 05:06:10,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:10,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639252741] [2024-10-11 05:06:10,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:10,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:06:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:06:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:06:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:06:10,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:10,555 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:10,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:10,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639252741] [2024-10-11 05:06:10,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639252741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:10,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:10,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:10,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014720639] [2024-10-11 05:06:10,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:10,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:10,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:10,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:10,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:10,558 INFO L87 Difference]: Start difference. First operand 2203 states and 3417 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:11,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:11,956 INFO L93 Difference]: Finished difference Result 7977 states and 12497 transitions. [2024-10-11 05:06:11,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:06:11,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 05:06:11,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:11,991 INFO L225 Difference]: With dead ends: 7977 [2024-10-11 05:06:11,991 INFO L226 Difference]: Without dead ends: 5784 [2024-10-11 05:06:12,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:06:12,001 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 629 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:12,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 602 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:06:12,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2024-10-11 05:06:12,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 4078. [2024-10-11 05:06:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4078 states, 3476 states have (on average 1.5379746835443038) internal successors, (5346), 3510 states have internal predecessors, (5346), 371 states have call successors, (371), 199 states have call predecessors, (371), 230 states have return successors, (644), 400 states have call predecessors, (644), 369 states have call successors, (644) [2024-10-11 05:06:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4078 states to 4078 states and 6361 transitions. [2024-10-11 05:06:12,436 INFO L78 Accepts]: Start accepts. Automaton has 4078 states and 6361 transitions. Word has length 72 [2024-10-11 05:06:12,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:12,436 INFO L471 AbstractCegarLoop]: Abstraction has 4078 states and 6361 transitions. [2024-10-11 05:06:12,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:12,437 INFO L276 IsEmpty]: Start isEmpty. Operand 4078 states and 6361 transitions. [2024-10-11 05:06:12,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 05:06:12,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:12,441 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] [2024-10-11 05:06:12,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 05:06:12,442 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:12,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:12,442 INFO L85 PathProgramCache]: Analyzing trace with hash -281241815, now seen corresponding path program 1 times [2024-10-11 05:06:12,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:12,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308044555] [2024-10-11 05:06:12,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:12,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:06:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:06:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:06:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:06:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:12,558 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:12,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:12,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308044555] [2024-10-11 05:06:12,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308044555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:12,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:12,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:12,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182854297] [2024-10-11 05:06:12,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:12,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:12,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:12,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:12,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:12,561 INFO L87 Difference]: Start difference. First operand 4078 states and 6361 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:14,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:14,466 INFO L93 Difference]: Finished difference Result 14219 states and 22391 transitions. [2024-10-11 05:06:14,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 05:06:14,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 05:06:14,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:14,524 INFO L225 Difference]: With dead ends: 14219 [2024-10-11 05:06:14,524 INFO L226 Difference]: Without dead ends: 10151 [2024-10-11 05:06:14,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 05:06:14,541 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 508 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:14,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 877 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 05:06:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10151 states. [2024-10-11 05:06:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10151 to 8018. [2024-10-11 05:06:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8018 states, 6872 states have (on average 1.540454016298021) internal successors, (10586), 6938 states have internal predecessors, (10586), 691 states have call successors, (691), 391 states have call predecessors, (691), 454 states have return successors, (1482), 752 states have call predecessors, (1482), 689 states have call successors, (1482) [2024-10-11 05:06:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8018 states to 8018 states and 12759 transitions. [2024-10-11 05:06:15,455 INFO L78 Accepts]: Start accepts. Automaton has 8018 states and 12759 transitions. Word has length 72 [2024-10-11 05:06:15,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:15,456 INFO L471 AbstractCegarLoop]: Abstraction has 8018 states and 12759 transitions. [2024-10-11 05:06:15,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 8018 states and 12759 transitions. [2024-10-11 05:06:15,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 05:06:15,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:15,465 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] [2024-10-11 05:06:15,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 05:06:15,465 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:15,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:15,466 INFO L85 PathProgramCache]: Analyzing trace with hash 162658859, now seen corresponding path program 1 times [2024-10-11 05:06:15,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:15,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029830211] [2024-10-11 05:06:15,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:15,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:15,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:15,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:06:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:15,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:06:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:15,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:06:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:15,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:06:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:15,580 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:15,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:15,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029830211] [2024-10-11 05:06:15,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029830211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:15,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:15,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 05:06:15,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035534441] [2024-10-11 05:06:15,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:15,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:06:15,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:15,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:06:15,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:06:15,582 INFO L87 Difference]: Start difference. First operand 8018 states and 12759 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:16,782 INFO L93 Difference]: Finished difference Result 17822 states and 28515 transitions. [2024-10-11 05:06:16,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:06:16,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 05:06:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:16,836 INFO L225 Difference]: With dead ends: 17822 [2024-10-11 05:06:16,837 INFO L226 Difference]: Without dead ends: 9815 [2024-10-11 05:06:16,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:06:16,870 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 173 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:16,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 504 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 05:06:16,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9815 states. [2024-10-11 05:06:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9815 to 8148. [2024-10-11 05:06:17,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8148 states, 7002 states have (on average 1.5304198800342759) internal successors, (10716), 7068 states have internal predecessors, (10716), 691 states have call successors, (691), 391 states have call predecessors, (691), 454 states have return successors, (1482), 752 states have call predecessors, (1482), 689 states have call successors, (1482) [2024-10-11 05:06:17,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8148 states to 8148 states and 12889 transitions. [2024-10-11 05:06:17,845 INFO L78 Accepts]: Start accepts. Automaton has 8148 states and 12889 transitions. Word has length 72 [2024-10-11 05:06:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:17,846 INFO L471 AbstractCegarLoop]: Abstraction has 8148 states and 12889 transitions. [2024-10-11 05:06:17,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 8148 states and 12889 transitions. [2024-10-11 05:06:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 05:06:17,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:17,856 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] [2024-10-11 05:06:17,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 05:06:17,857 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:17,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:17,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1056145197, now seen corresponding path program 1 times [2024-10-11 05:06:17,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:17,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493623422] [2024-10-11 05:06:17,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:17,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:17,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:17,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:06:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:17,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:06:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:06:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:06:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:18,017 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,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:18,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493623422] [2024-10-11 05:06:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493623422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:18,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:06:18,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:06:18,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127387023] [2024-10-11 05:06:18,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:18,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 05:06:18,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:18,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 05:06:18,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:18,021 INFO L87 Difference]: Start difference. First operand 8148 states and 12889 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:21,377 INFO L93 Difference]: Finished difference Result 35574 states and 57074 transitions. [2024-10-11 05:06:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 05:06:21,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2024-10-11 05:06:21,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:21,515 INFO L225 Difference]: With dead ends: 35574 [2024-10-11 05:06:21,515 INFO L226 Difference]: Without dead ends: 27437 [2024-10-11 05:06:21,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-10-11 05:06:21,568 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 1177 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:21,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 717 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 05:06:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27437 states. [2024-10-11 05:06:23,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27437 to 23063. [2024-10-11 05:06:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23063 states, 19702 states have (on average 1.507917977870267) internal successors, (29709), 19995 states have internal predecessors, (29709), 2000 states have call successors, (2000), 1169 states have call predecessors, (2000), 1360 states have return successors, (4477), 1962 states have call predecessors, (4477), 1998 states have call successors, (4477) [2024-10-11 05:06:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23063 states to 23063 states and 36186 transitions. [2024-10-11 05:06:23,867 INFO L78 Accepts]: Start accepts. Automaton has 23063 states and 36186 transitions. Word has length 72 [2024-10-11 05:06:23,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:23,868 INFO L471 AbstractCegarLoop]: Abstraction has 23063 states and 36186 transitions. [2024-10-11 05:06:23,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 05:06:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 23063 states and 36186 transitions. [2024-10-11 05:06:23,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 05:06:23,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:23,927 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 05:06:23,927 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:23,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:23,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1186869739, now seen corresponding path program 1 times [2024-10-11 05:06:23,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:23,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319896832] [2024-10-11 05:06:23,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:23,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:23,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:23,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 05:06:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:24,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:06:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:24,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:06:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:24,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:06:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:24,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:06:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:24,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:24,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:06:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:24,049 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 05:06:24,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:24,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319896832] [2024-10-11 05:06:24,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319896832] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:06:24,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455007944] [2024-10-11 05:06:24,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:24,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:06:24,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:06:24,052 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:06:24,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 05:06:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:24,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:06:24,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:06:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 05:06:24,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:06:24,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455007944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:24,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:06:24,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 05:06:24,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787709148] [2024-10-11 05:06:24,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:24,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:06:24,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:24,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:06:24,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:24,272 INFO L87 Difference]: Start difference. First operand 23063 states and 36186 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:06:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:28,332 INFO L93 Difference]: Finished difference Result 68550 states and 108624 transitions. [2024-10-11 05:06:28,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:06:28,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 116 [2024-10-11 05:06:28,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:28,576 INFO L225 Difference]: With dead ends: 68550 [2024-10-11 05:06:28,577 INFO L226 Difference]: Without dead ends: 45498 [2024-10-11 05:06:28,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:28,655 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 177 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:28,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 390 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:06:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45498 states. [2024-10-11 05:06:32,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45498 to 45298. [2024-10-11 05:06:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45298 states, 38699 states have (on average 1.5018992738830461) internal successors, (58122), 39283 states have internal predecessors, (58122), 3886 states have call successors, (3886), 2329 states have call predecessors, (3886), 2712 states have return successors, (8728), 3749 states have call predecessors, (8728), 3884 states have call successors, (8728) [2024-10-11 05:06:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45298 states to 45298 states and 70736 transitions. [2024-10-11 05:06:33,256 INFO L78 Accepts]: Start accepts. Automaton has 45298 states and 70736 transitions. Word has length 116 [2024-10-11 05:06:33,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:06:33,258 INFO L471 AbstractCegarLoop]: Abstraction has 45298 states and 70736 transitions. [2024-10-11 05:06:33,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 05:06:33,259 INFO L276 IsEmpty]: Start isEmpty. Operand 45298 states and 70736 transitions. [2024-10-11 05:06:33,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 05:06:33,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:06:33,356 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 05:06:33,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 05:06:33,562 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:06:33,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:06:33,563 INFO L85 PathProgramCache]: Analyzing trace with hash 294109079, now seen corresponding path program 1 times [2024-10-11 05:06:33,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:06:33,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729259954] [2024-10-11 05:06:33,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:33,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:06:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 05:06:33,611 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 11 [2024-10-11 05:06:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 05:06:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 05:06:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 05:06:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 05:06:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 05:06:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 05:06:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,701 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 05:06:33,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:06:33,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729259954] [2024-10-11 05:06:33,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729259954] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 05:06:33,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218030687] [2024-10-11 05:06:33,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:06:33,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 05:06:33,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:06:33,704 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 05:06:33,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 05:06:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:06:33,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 05:06:33,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:06:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 05:06:33,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:06:33,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218030687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:06:33,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 05:06:33,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 05:06:33,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403124321] [2024-10-11 05:06:33,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:06:33,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 05:06:33,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:06:33,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 05:06:33,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:33,857 INFO L87 Difference]: Start difference. First operand 45298 states and 70736 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 05:06:40,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:06:40,714 INFO L93 Difference]: Finished difference Result 133475 states and 209517 transitions. [2024-10-11 05:06:40,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 05:06:40,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 116 [2024-10-11 05:06:40,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:06:41,184 INFO L225 Difference]: With dead ends: 133475 [2024-10-11 05:06:41,184 INFO L226 Difference]: Without dead ends: 52951 [2024-10-11 05:06:41,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 05:06:41,433 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 182 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:06:41,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 582 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:06:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52951 states.