./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9629d1cdaf2a4c1ffb7c786f584a153b15eed3823334fbbe8ec635b18d57c1af --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:15:08,307 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:15:08,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 05:15:08,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:15:08,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:15:08,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:15:08,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:15:08,386 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:15:08,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:15:08,389 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:15:08,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:15:08,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:15:08,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:15:08,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:15:08,391 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:15:08,391 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:15:08,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:15:08,392 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 05:15:08,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:15:08,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 05:15:08,392 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:15:08,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:15:08,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:15:08,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:15:08,394 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:15:08,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 05:15:08,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:15:08,394 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:15:08,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:15:08,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:15:08,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:15:08,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:15:08,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:15:08,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:15:08,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:15:08,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:15:08,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:15:08,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:15:08,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:15:08,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:15:08,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:15:08,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:15:08,398 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/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/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 -> 9629d1cdaf2a4c1ffb7c786f584a153b15eed3823334fbbe8ec635b18d57c1af [2024-10-14 05:15:08,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:15:08,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:15:08,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:15:08,645 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:15:08,646 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:15:08,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c [2024-10-14 05:15:09,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:15:10,041 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:15:10,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c [2024-10-14 05:15:10,057 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf826aad/3d7d28b28224419a967732ca28838bfc/FLAG2f02a60c9 [2024-10-14 05:15:10,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf826aad/3d7d28b28224419a967732ca28838bfc [2024-10-14 05:15:10,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:15:10,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:15:10,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:15:10,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:15:10,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:15:10,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:15:10" (1/1) ... [2024-10-14 05:15:10,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@328d9389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:10, skipping insertion in model container [2024-10-14 05:15:10,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:15:10" (1/1) ... [2024-10-14 05:15:10,137 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:15:10,265 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c[911,924] [2024-10-14 05:15:10,312 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c[8416,8429] [2024-10-14 05:15:10,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:15:10,381 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:15:10,389 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c[911,924] [2024-10-14 05:15:10,403 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c[8416,8429] [2024-10-14 05:15:10,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:15:10,462 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:15:10,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:10 WrapperNode [2024-10-14 05:15:10,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:15:10,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:15:10,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:15:10,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:15:10,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:10" (1/1) ... [2024-10-14 05:15:10,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:10" (1/1) ... [2024-10-14 05:15:10,530 INFO L138 Inliner]: procedures = 69, calls = 83, calls flagged for inlining = 37, calls inlined = 37, statements flattened = 812 [2024-10-14 05:15:10,530 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:15:10,531 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:15:10,531 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:15:10,531 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:15:10,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:10" (1/1) ... [2024-10-14 05:15:10,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:10" (1/1) ... [2024-10-14 05:15:10,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:10" (1/1) ... [2024-10-14 05:15:10,562 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-14 05:15:10,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:10" (1/1) ... [2024-10-14 05:15:10,563 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:10" (1/1) ... [2024-10-14 05:15:10,571 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:10" (1/1) ... [2024-10-14 05:15:10,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:10" (1/1) ... [2024-10-14 05:15:10,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:10" (1/1) ... [2024-10-14 05:15:10,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:10" (1/1) ... [2024-10-14 05:15:10,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:15:10,591 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:15:10,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:15:10,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:15:10,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:10" (1/1) ... [2024-10-14 05:15:10,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:15:10,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:15:10,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:15:10,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:15:10,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:15:10,675 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 05:15:10,675 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 05:15:10,675 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-14 05:15:10,676 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-14 05:15:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-14 05:15:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-14 05:15:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-14 05:15:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-14 05:15:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-10-14 05:15:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-10-14 05:15:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-14 05:15:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-14 05:15:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-14 05:15:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-14 05:15:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-10-14 05:15:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-10-14 05:15:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-14 05:15:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-14 05:15:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-10-14 05:15:10,677 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-10-14 05:15:10,677 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-14 05:15:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-14 05:15:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:15:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-14 05:15:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-14 05:15:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-10-14 05:15:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-10-14 05:15:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:15:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:15:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-14 05:15:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-14 05:15:10,678 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-14 05:15:10,678 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-14 05:15:10,796 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:15:10,799 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:15:11,313 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-10-14 05:15:11,313 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-14 05:15:11,432 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-10-14 05:15:11,433 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:15:11,495 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:15:11,495 INFO L314 CfgBuilder]: Removed 14 assume(true) statements. [2024-10-14 05:15:11,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:15:11 BoogieIcfgContainer [2024-10-14 05:15:11,495 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:15:11,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:15:11,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:15:11,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:15:11,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:15:10" (1/3) ... [2024-10-14 05:15:11,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff4a7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:15:11, skipping insertion in model container [2024-10-14 05:15:11,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:10" (2/3) ... [2024-10-14 05:15:11,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff4a7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:15:11, skipping insertion in model container [2024-10-14 05:15:11,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:15:11" (3/3) ... [2024-10-14 05:15:11,503 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.07.cil-2.c [2024-10-14 05:15:11,516 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:15:11,516 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 05:15:11,580 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:15:11,586 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;@52440ad1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:15:11,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 05:15:11,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 345 states, 288 states have (on average 1.6979166666666667) internal successors, (489), 296 states have internal predecessors, (489), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-14 05:15:11,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 05:15:11,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:11,601 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-14 05:15:11,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:11,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:11,605 INFO L85 PathProgramCache]: Analyzing trace with hash -757185145, now seen corresponding path program 1 times [2024-10-14 05:15:11,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:11,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745724908] [2024-10-14 05:15:11,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:11,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:11,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:11,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:11,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:11,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:11,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:15:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:11,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:15:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:11,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:15:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:11,950 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-14 05:15:11,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:11,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745724908] [2024-10-14 05:15:11,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745724908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:11,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:11,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:15:11,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446084545] [2024-10-14 05:15:11,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:11,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:15:11,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:11,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:15:11,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:15:11,991 INFO L87 Difference]: Start difference. First operand has 345 states, 288 states have (on average 1.6979166666666667) internal successors, (489), 296 states have internal predecessors, (489), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:15:12,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:12,760 INFO L93 Difference]: Finished difference Result 687 states and 1127 transitions. [2024-10-14 05:15:12,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 05:15:12,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-14 05:15:12,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:12,773 INFO L225 Difference]: With dead ends: 687 [2024-10-14 05:15:12,775 INFO L226 Difference]: Without dead ends: 356 [2024-10-14 05:15:12,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:15:12,786 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 562 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:12,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1097 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:15:12,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-14 05:15:12,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 339. [2024-10-14 05:15:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 285 states have (on average 1.5894736842105264) internal successors, (453), 290 states have internal predecessors, (453), 39 states have call successors, (39), 15 states have call predecessors, (39), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 05:15:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 527 transitions. [2024-10-14 05:15:12,847 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 527 transitions. Word has length 57 [2024-10-14 05:15:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:12,847 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 527 transitions. [2024-10-14 05:15:12,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:15:12,848 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 527 transitions. [2024-10-14 05:15:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 05:15:12,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:12,851 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-14 05:15:12,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:15:12,851 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:12,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:12,852 INFO L85 PathProgramCache]: Analyzing trace with hash -741666427, now seen corresponding path program 1 times [2024-10-14 05:15:12,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:12,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707066285] [2024-10-14 05:15:12,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:12,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:13,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:13,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:13,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:13,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:13,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:15:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:13,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:15:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:13,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:15:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:13,061 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-14 05:15:13,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:13,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707066285] [2024-10-14 05:15:13,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707066285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:13,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:13,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:15:13,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580839145] [2024-10-14 05:15:13,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:13,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:15:13,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:13,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:15:13,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:15:13,064 INFO L87 Difference]: Start difference. First operand 339 states and 527 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 05:15:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:13,909 INFO L93 Difference]: Finished difference Result 571 states and 873 transitions. [2024-10-14 05:15:13,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:15:13,909 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-14 05:15:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:13,913 INFO L225 Difference]: With dead ends: 571 [2024-10-14 05:15:13,913 INFO L226 Difference]: Without dead ends: 477 [2024-10-14 05:15:13,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:15:13,915 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 937 mSDsluCounter, 1089 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:13,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 1370 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:15:13,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-14 05:15:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 440. [2024-10-14 05:15:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 364 states have (on average 1.5604395604395604) internal successors, (568), 371 states have internal predecessors, (568), 52 states have call successors, (52), 22 states have call predecessors, (52), 22 states have return successors, (53), 49 states have call predecessors, (53), 48 states have call successors, (53) [2024-10-14 05:15:13,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 673 transitions. [2024-10-14 05:15:13,966 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 673 transitions. Word has length 57 [2024-10-14 05:15:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:13,966 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 673 transitions. [2024-10-14 05:15:13,966 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-14 05:15:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 673 transitions. [2024-10-14 05:15:13,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 05:15:13,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:13,971 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-14 05:15:13,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:15:13,971 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:13,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:13,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1609308101, now seen corresponding path program 1 times [2024-10-14 05:15:13,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:13,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682049983] [2024-10-14 05:15:13,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:13,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:14,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:14,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:14,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:14,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:14,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:15:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:14,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:15:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:14,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:15:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:14,138 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-14 05:15:14,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:14,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682049983] [2024-10-14 05:15:14,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682049983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:14,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:14,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:15:14,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887155402] [2024-10-14 05:15:14,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:14,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:15:14,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:14,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:15:14,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:15:14,141 INFO L87 Difference]: Start difference. First operand 440 states and 673 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-14 05:15:15,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:15,134 INFO L93 Difference]: Finished difference Result 801 states and 1202 transitions. [2024-10-14 05:15:15,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 05:15:15,135 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-14 05:15:15,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:15,138 INFO L225 Difference]: With dead ends: 801 [2024-10-14 05:15:15,138 INFO L226 Difference]: Without dead ends: 613 [2024-10-14 05:15:15,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-14 05:15:15,139 INFO L432 NwaCegarLoop]: 289 mSDtfsCounter, 1042 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:15,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 1495 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 05:15:15,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2024-10-14 05:15:15,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 541. [2024-10-14 05:15:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 443 states have (on average 1.5395033860045146) internal successors, (682), 452 states have internal predecessors, (682), 65 states have call successors, (65), 29 states have call predecessors, (65), 31 states have return successors, (74), 63 states have call predecessors, (74), 61 states have call successors, (74) [2024-10-14 05:15:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 821 transitions. [2024-10-14 05:15:15,191 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 821 transitions. Word has length 57 [2024-10-14 05:15:15,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:15,192 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 821 transitions. [2024-10-14 05:15:15,192 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-14 05:15:15,192 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 821 transitions. [2024-10-14 05:15:15,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 05:15:15,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:15,197 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-14 05:15:15,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:15:15,197 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:15,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:15,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1792172857, now seen corresponding path program 1 times [2024-10-14 05:15:15,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:15,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70867521] [2024-10-14 05:15:15,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:15,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:15,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:15,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:15,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:15,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:15,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 05:15:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:15,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 05:15:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:15,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 05:15:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:15,292 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-14 05:15:15,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:15,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70867521] [2024-10-14 05:15:15,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70867521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:15,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:15,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:15:15,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854030006] [2024-10-14 05:15:15,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:15,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:15:15,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:15,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:15:15,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:15:15,295 INFO L87 Difference]: Start difference. First operand 541 states and 821 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-14 05:15:16,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:16,042 INFO L93 Difference]: Finished difference Result 1147 states and 1697 transitions. [2024-10-14 05:15:16,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:15:16,043 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-14 05:15:16,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:16,046 INFO L225 Difference]: With dead ends: 1147 [2024-10-14 05:15:16,047 INFO L226 Difference]: Without dead ends: 864 [2024-10-14 05:15:16,048 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-14 05:15:16,048 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 1377 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:16,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 1054 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:15:16,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2024-10-14 05:15:16,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 793. [2024-10-14 05:15:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 640 states have (on average 1.5) internal successors, (960), 653 states have internal predecessors, (960), 95 states have call successors, (95), 50 states have call predecessors, (95), 56 states have return successors, (112), 93 states have call predecessors, (112), 91 states have call successors, (112) [2024-10-14 05:15:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1167 transitions. [2024-10-14 05:15:16,105 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1167 transitions. Word has length 57 [2024-10-14 05:15:16,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:16,106 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1167 transitions. [2024-10-14 05:15:16,106 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-14 05:15:16,106 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1167 transitions. [2024-10-14 05:15:16,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:15:16,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:16,108 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-14 05:15:16,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:15:16,108 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:16,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:16,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1940219858, now seen corresponding path program 1 times [2024-10-14 05:15:16,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:16,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443297562] [2024-10-14 05:15:16,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:16,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:16,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:16,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:16,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:16,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:16,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:16,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 05:15:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:16,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:15:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:16,233 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-14 05:15:16,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:16,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443297562] [2024-10-14 05:15:16,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443297562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:16,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:16,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:15:16,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431642668] [2024-10-14 05:15:16,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:16,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:15:16,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:16,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:15:16,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:15:16,236 INFO L87 Difference]: Start difference. First operand 793 states and 1167 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-14 05:15:17,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:17,105 INFO L93 Difference]: Finished difference Result 1428 states and 2082 transitions. [2024-10-14 05:15:17,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 05:15:17,106 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-14 05:15:17,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:17,110 INFO L225 Difference]: With dead ends: 1428 [2024-10-14 05:15:17,110 INFO L226 Difference]: Without dead ends: 893 [2024-10-14 05:15:17,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:15:17,113 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 656 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:17,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1689 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:15:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2024-10-14 05:15:17,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 817. [2024-10-14 05:15:17,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 658 states have (on average 1.486322188449848) internal successors, (978), 671 states have internal predecessors, (978), 95 states have call successors, (95), 50 states have call predecessors, (95), 62 states have return successors, (118), 99 states have call predecessors, (118), 91 states have call successors, (118) [2024-10-14 05:15:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1191 transitions. [2024-10-14 05:15:17,163 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1191 transitions. Word has length 58 [2024-10-14 05:15:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:17,163 INFO L471 AbstractCegarLoop]: Abstraction has 817 states and 1191 transitions. [2024-10-14 05:15:17,164 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-14 05:15:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1191 transitions. [2024-10-14 05:15:17,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:15:17,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:17,165 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-14 05:15:17,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:15:17,165 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:17,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:17,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2080768468, now seen corresponding path program 1 times [2024-10-14 05:15:17,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:17,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528310672] [2024-10-14 05:15:17,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:17,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:17,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:17,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:17,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:17,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:17,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:17,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 05:15:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:17,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:15:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:17,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-14 05:15:17,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:17,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528310672] [2024-10-14 05:15:17,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528310672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:17,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:17,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:15:17,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168808920] [2024-10-14 05:15:17,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:17,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:15:17,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:17,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:15:17,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:15:17,299 INFO L87 Difference]: Start difference. First operand 817 states and 1191 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-14 05:15:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:18,167 INFO L93 Difference]: Finished difference Result 1449 states and 2085 transitions. [2024-10-14 05:15:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:15:18,168 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-14 05:15:18,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:18,173 INFO L225 Difference]: With dead ends: 1449 [2024-10-14 05:15:18,173 INFO L226 Difference]: Without dead ends: 890 [2024-10-14 05:15:18,174 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-14 05:15:18,175 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 439 mSDsluCounter, 1617 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1900 SdHoareTripleChecker+Invalid, 1716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:18,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1900 Invalid, 1716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 05:15:18,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-10-14 05:15:18,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 829. [2024-10-14 05:15:18,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 667 states have (on average 1.4752623688155921) internal successors, (984), 680 states have internal predecessors, (984), 95 states have call successors, (95), 50 states have call predecessors, (95), 65 states have return successors, (121), 102 states have call predecessors, (121), 91 states have call successors, (121) [2024-10-14 05:15:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1200 transitions. [2024-10-14 05:15:18,215 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1200 transitions. Word has length 58 [2024-10-14 05:15:18,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:18,217 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1200 transitions. [2024-10-14 05:15:18,217 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-14 05:15:18,217 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1200 transitions. [2024-10-14 05:15:18,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 05:15:18,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:18,219 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-14 05:15:18,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:15:18,219 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:18,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:18,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2141812270, now seen corresponding path program 1 times [2024-10-14 05:15:18,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:18,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366877690] [2024-10-14 05:15:18,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:18,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:18,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:18,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:18,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:18,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:18,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:18,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 05:15:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:18,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 05:15:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:18,325 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-14 05:15:18,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:18,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366877690] [2024-10-14 05:15:18,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366877690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:18,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:18,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:15:18,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126276256] [2024-10-14 05:15:18,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:18,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:15:18,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:18,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:15:18,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:15:18,327 INFO L87 Difference]: Start difference. First operand 829 states and 1200 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-14 05:15:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:20,013 INFO L93 Difference]: Finished difference Result 2934 states and 4262 transitions. [2024-10-14 05:15:20,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-14 05:15:20,017 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-14 05:15:20,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:20,023 INFO L225 Difference]: With dead ends: 2934 [2024-10-14 05:15:20,024 INFO L226 Difference]: Without dead ends: 1182 [2024-10-14 05:15:20,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 05:15:20,032 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 1865 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1886 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 2565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:20,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1886 Valid, 1975 Invalid, 2565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:15:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-10-14 05:15:20,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1044. [2024-10-14 05:15:20,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 823 states have (on average 1.4240583232077764) internal successors, (1172), 840 states have internal predecessors, (1172), 125 states have call successors, (125), 71 states have call predecessors, (125), 94 states have return successors, (173), 136 states have call predecessors, (173), 121 states have call successors, (173) [2024-10-14 05:15:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1470 transitions. [2024-10-14 05:15:20,087 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1470 transitions. Word has length 58 [2024-10-14 05:15:20,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:20,088 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1470 transitions. [2024-10-14 05:15:20,088 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-14 05:15:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1470 transitions. [2024-10-14 05:15:20,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 05:15:20,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:20,089 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-14 05:15:20,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 05:15:20,090 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:20,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:20,092 INFO L85 PathProgramCache]: Analyzing trace with hash -292571228, now seen corresponding path program 1 times [2024-10-14 05:15:20,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:20,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114123407] [2024-10-14 05:15:20,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:20,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:20,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:20,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:20,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:20,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 05:15:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:20,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 05:15:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:20,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 05:15:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:20,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 05:15:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:20,222 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-14 05:15:20,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:20,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114123407] [2024-10-14 05:15:20,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114123407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:20,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:20,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 05:15:20,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498521570] [2024-10-14 05:15:20,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:20,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:15:20,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:20,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:15:20,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:15:20,223 INFO L87 Difference]: Start difference. First operand 1044 states and 1470 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-14 05:15:21,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:21,036 INFO L93 Difference]: Finished difference Result 2136 states and 3019 transitions. [2024-10-14 05:15:21,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 05:15:21,036 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-14 05:15:21,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:21,039 INFO L225 Difference]: With dead ends: 2136 [2024-10-14 05:15:21,039 INFO L226 Difference]: Without dead ends: 239 [2024-10-14 05:15:21,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2024-10-14 05:15:21,044 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 1343 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 1365 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:21,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 1365 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 05:15:21,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-14 05:15:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-10-14 05:15:21,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 209 states have (on average 1.6172248803827751) internal successors, (338), 211 states have internal predecessors, (338), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 05:15:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 382 transitions. [2024-10-14 05:15:21,053 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 382 transitions. Word has length 59 [2024-10-14 05:15:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:21,054 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 382 transitions. [2024-10-14 05:15:21,054 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-14 05:15:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 382 transitions. [2024-10-14 05:15:21,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:15:21,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:21,055 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:15:21,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 05:15:21,055 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:21,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:21,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1618565886, now seen corresponding path program 1 times [2024-10-14 05:15:21,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:21,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224802953] [2024-10-14 05:15:21,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:21,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:21,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:21,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:21,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:15:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:21,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:15:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:21,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:15:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:21,176 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-14 05:15:21,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:21,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224802953] [2024-10-14 05:15:21,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224802953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:21,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:21,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:15:21,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907200732] [2024-10-14 05:15:21,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:21,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 05:15:21,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:21,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 05:15:21,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 05:15:21,178 INFO L87 Difference]: Start difference. First operand 239 states and 382 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:21,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:21,826 INFO L93 Difference]: Finished difference Result 553 states and 900 transitions. [2024-10-14 05:15:21,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:15:21,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-14 05:15:21,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:21,828 INFO L225 Difference]: With dead ends: 553 [2024-10-14 05:15:21,829 INFO L226 Difference]: Without dead ends: 319 [2024-10-14 05:15:21,829 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-14 05:15:21,830 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 636 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:21,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 446 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 05:15:21,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-14 05:15:21,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 239. [2024-10-14 05:15:21,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 209 states have (on average 1.61244019138756) internal successors, (337), 211 states have internal predecessors, (337), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 05:15:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 381 transitions. [2024-10-14 05:15:21,843 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 381 transitions. Word has length 112 [2024-10-14 05:15:21,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:21,843 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 381 transitions. [2024-10-14 05:15:21,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:21,843 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 381 transitions. [2024-10-14 05:15:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:15:21,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:21,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:15:21,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 05:15:21,844 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:21,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:21,845 INFO L85 PathProgramCache]: Analyzing trace with hash -995284284, now seen corresponding path program 1 times [2024-10-14 05:15:21,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:21,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430791165] [2024-10-14 05:15:21,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:21,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:21,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:21,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:21,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:15:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:21,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:15:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:21,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:15:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:22,003 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-14 05:15:22,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:22,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430791165] [2024-10-14 05:15:22,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430791165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:22,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:22,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 05:15:22,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231603109] [2024-10-14 05:15:22,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:22,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:15:22,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:22,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:15:22,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:15:22,005 INFO L87 Difference]: Start difference. First operand 239 states and 381 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:23,167 INFO L93 Difference]: Finished difference Result 858 states and 1401 transitions. [2024-10-14 05:15:23,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 05:15:23,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-14 05:15:23,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:23,171 INFO L225 Difference]: With dead ends: 858 [2024-10-14 05:15:23,171 INFO L226 Difference]: Without dead ends: 633 [2024-10-14 05:15:23,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 05:15:23,172 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 948 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:23,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 750 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 05:15:23,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-10-14 05:15:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 472. [2024-10-14 05:15:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 419 states have (on average 1.6229116945107398) internal successors, (680), 422 states have internal predecessors, (680), 39 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2024-10-14 05:15:23,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 759 transitions. [2024-10-14 05:15:23,207 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 759 transitions. Word has length 112 [2024-10-14 05:15:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:23,209 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 759 transitions. [2024-10-14 05:15:23,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 759 transitions. [2024-10-14 05:15:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:15:23,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:23,210 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:15:23,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 05:15:23,210 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:23,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:23,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1031488, now seen corresponding path program 1 times [2024-10-14 05:15:23,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:23,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433717750] [2024-10-14 05:15:23,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:23,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:23,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:23,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:23,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:15:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:23,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:15:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:23,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:15:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:23,361 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-14 05:15:23,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:23,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433717750] [2024-10-14 05:15:23,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433717750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:23,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:23,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:15:23,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504101489] [2024-10-14 05:15:23,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:23,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:15:23,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:23,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:15:23,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:15:23,363 INFO L87 Difference]: Start difference. First operand 472 states and 759 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:24,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:24,927 INFO L93 Difference]: Finished difference Result 1413 states and 2307 transitions. [2024-10-14 05:15:24,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:15:24,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-14 05:15:24,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:24,932 INFO L225 Difference]: With dead ends: 1413 [2024-10-14 05:15:24,932 INFO L226 Difference]: Without dead ends: 955 [2024-10-14 05:15:24,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:15:24,933 INFO L432 NwaCegarLoop]: 335 mSDtfsCounter, 961 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 2443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:24,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 1426 Invalid, 2443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:15:24,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2024-10-14 05:15:24,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 688. [2024-10-14 05:15:24,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 612 states have (on average 1.6160130718954249) internal successors, (989), 616 states have internal predecessors, (989), 55 states have call successors, (55), 19 states have call predecessors, (55), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-10-14 05:15:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1102 transitions. [2024-10-14 05:15:24,983 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1102 transitions. Word has length 112 [2024-10-14 05:15:24,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:24,983 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1102 transitions. [2024-10-14 05:15:24,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:24,983 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1102 transitions. [2024-10-14 05:15:24,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:15:24,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:24,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:15:24,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 05:15:24,986 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:24,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:24,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1350353730, now seen corresponding path program 1 times [2024-10-14 05:15:24,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:24,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323320172] [2024-10-14 05:15:24,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:24,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:25,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:25,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:25,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:15:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:25,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:15:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:25,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:15:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:15:25,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:25,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323320172] [2024-10-14 05:15:25,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323320172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:25,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:25,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:15:25,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088415862] [2024-10-14 05:15:25,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:25,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:15:25,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:25,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:15:25,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:15:25,144 INFO L87 Difference]: Start difference. First operand 688 states and 1102 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:26,672 INFO L93 Difference]: Finished difference Result 2226 states and 3628 transitions. [2024-10-14 05:15:26,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:15:26,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-14 05:15:26,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:26,679 INFO L225 Difference]: With dead ends: 2226 [2024-10-14 05:15:26,679 INFO L226 Difference]: Without dead ends: 1552 [2024-10-14 05:15:26,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:15:26,681 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 959 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 2384 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 2441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:26,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 1424 Invalid, 2441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2384 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:15:26,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2024-10-14 05:15:26,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1121. [2024-10-14 05:15:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 999 states have (on average 1.6096096096096095) internal successors, (1608), 1005 states have internal predecessors, (1608), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-10-14 05:15:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1793 transitions. [2024-10-14 05:15:26,769 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1793 transitions. Word has length 112 [2024-10-14 05:15:26,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:26,769 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1793 transitions. [2024-10-14 05:15:26,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1793 transitions. [2024-10-14 05:15:26,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:15:26,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:26,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:15:26,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 05:15:26,771 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:26,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:26,771 INFO L85 PathProgramCache]: Analyzing trace with hash -268621184, now seen corresponding path program 1 times [2024-10-14 05:15:26,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:26,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570311526] [2024-10-14 05:15:26,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:26,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:26,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:26,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:26,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:15:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:26,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:15:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:26,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:15:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:26,934 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-14 05:15:26,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:26,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570311526] [2024-10-14 05:15:26,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570311526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:26,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:26,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:15:26,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012834351] [2024-10-14 05:15:26,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:26,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:15:26,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:26,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:15:26,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:15:26,935 INFO L87 Difference]: Start difference. First operand 1121 states and 1793 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:28,509 INFO L93 Difference]: Finished difference Result 3787 states and 6155 transitions. [2024-10-14 05:15:28,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:15:28,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-14 05:15:28,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:28,519 INFO L225 Difference]: With dead ends: 3787 [2024-10-14 05:15:28,519 INFO L226 Difference]: Without dead ends: 2680 [2024-10-14 05:15:28,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:15:28,522 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 961 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 2427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:28,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 1424 Invalid, 2427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:15:28,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2024-10-14 05:15:28,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 1988. [2024-10-14 05:15:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1988 states, 1774 states have (on average 1.6042841037204059) internal successors, (2846), 1784 states have internal predecessors, (2846), 151 states have call successors, (151), 55 states have call predecessors, (151), 62 states have return successors, (184), 156 states have call predecessors, (184), 149 states have call successors, (184) [2024-10-14 05:15:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1988 states and 3181 transitions. [2024-10-14 05:15:28,644 INFO L78 Accepts]: Start accepts. Automaton has 1988 states and 3181 transitions. Word has length 112 [2024-10-14 05:15:28,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:28,644 INFO L471 AbstractCegarLoop]: Abstraction has 1988 states and 3181 transitions. [2024-10-14 05:15:28,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 3181 transitions. [2024-10-14 05:15:28,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:15:28,646 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:28,646 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:15:28,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 05:15:28,646 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:28,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:28,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1152130174, now seen corresponding path program 1 times [2024-10-14 05:15:28,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:28,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669384412] [2024-10-14 05:15:28,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:28,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:28,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:28,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:28,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:15:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:28,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:15:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:28,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:15:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:28,790 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-14 05:15:28,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:28,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669384412] [2024-10-14 05:15:28,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669384412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:28,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:28,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:15:28,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969510823] [2024-10-14 05:15:28,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:28,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:15:28,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:28,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:15:28,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:15:28,792 INFO L87 Difference]: Start difference. First operand 1988 states and 3181 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:30,543 INFO L93 Difference]: Finished difference Result 6901 states and 11213 transitions. [2024-10-14 05:15:30,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:15:30,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-14 05:15:30,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:30,560 INFO L225 Difference]: With dead ends: 6901 [2024-10-14 05:15:30,560 INFO L226 Difference]: Without dead ends: 4927 [2024-10-14 05:15:30,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:15:30,565 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 957 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 2342 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 2399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:30,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 1424 Invalid, 2399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2342 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 05:15:30,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4927 states. [2024-10-14 05:15:30,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4927 to 3736. [2024-10-14 05:15:30,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3736 states, 3338 states have (on average 1.6015578190533253) internal successors, (5346), 3356 states have internal predecessors, (5346), 279 states have call successors, (279), 103 states have call predecessors, (279), 118 states have return successors, (374), 292 states have call predecessors, (374), 277 states have call successors, (374) [2024-10-14 05:15:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 5999 transitions. [2024-10-14 05:15:30,778 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 5999 transitions. Word has length 112 [2024-10-14 05:15:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:30,778 INFO L471 AbstractCegarLoop]: Abstraction has 3736 states and 5999 transitions. [2024-10-14 05:15:30,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 5999 transitions. [2024-10-14 05:15:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:15:30,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:30,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:15:30,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 05:15:30,781 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:30,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:30,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1202255108, now seen corresponding path program 1 times [2024-10-14 05:15:30,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:30,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147835535] [2024-10-14 05:15:30,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:30,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:30,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:30,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:30,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:15:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:30,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:15:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:30,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:15:30,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:30,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:15:30,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:30,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147835535] [2024-10-14 05:15:30,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147835535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:30,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:30,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:15:30,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806085304] [2024-10-14 05:15:30,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:30,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:15:30,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:30,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:15:30,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:15:30,911 INFO L87 Difference]: Start difference. First operand 3736 states and 5999 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:32,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:32,740 INFO L93 Difference]: Finished difference Result 13147 states and 21421 transitions. [2024-10-14 05:15:32,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:15:32,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-14 05:15:32,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:32,781 INFO L225 Difference]: With dead ends: 13147 [2024-10-14 05:15:32,781 INFO L226 Difference]: Without dead ends: 9425 [2024-10-14 05:15:32,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:15:32,794 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 956 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 2329 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 2386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:32,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 1424 Invalid, 2386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2329 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:15:32,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9425 states. [2024-10-14 05:15:33,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9425 to 7245. [2024-10-14 05:15:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7245 states, 6479 states have (on average 1.5996295724648866) internal successors, (10364), 6513 states have internal predecessors, (10364), 535 states have call successors, (535), 199 states have call predecessors, (535), 230 states have return successors, (808), 564 states have call predecessors, (808), 533 states have call successors, (808) [2024-10-14 05:15:33,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7245 states to 7245 states and 11707 transitions. [2024-10-14 05:15:33,293 INFO L78 Accepts]: Start accepts. Automaton has 7245 states and 11707 transitions. Word has length 112 [2024-10-14 05:15:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:33,295 INFO L471 AbstractCegarLoop]: Abstraction has 7245 states and 11707 transitions. [2024-10-14 05:15:33,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:33,295 INFO L276 IsEmpty]: Start isEmpty. Operand 7245 states and 11707 transitions. [2024-10-14 05:15:33,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:15:33,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:33,300 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:15:33,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 05:15:33,301 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:33,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:33,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1215648958, now seen corresponding path program 1 times [2024-10-14 05:15:33,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:33,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270891392] [2024-10-14 05:15:33,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:33,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:33,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:33,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:33,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:15:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:33,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:15:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:33,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:15:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:33,452 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-14 05:15:33,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:33,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270891392] [2024-10-14 05:15:33,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270891392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:33,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:33,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:15:33,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008333481] [2024-10-14 05:15:33,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:33,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:15:33,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:33,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:15:33,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:15:33,455 INFO L87 Difference]: Start difference. First operand 7245 states and 11707 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:35,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:35,743 INFO L93 Difference]: Finished difference Result 25638 states and 42027 transitions. [2024-10-14 05:15:35,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 05:15:35,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-14 05:15:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:35,805 INFO L225 Difference]: With dead ends: 25638 [2024-10-14 05:15:35,805 INFO L226 Difference]: Without dead ends: 18407 [2024-10-14 05:15:35,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 05:15:35,828 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 1023 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:35,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 928 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 05:15:35,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18407 states. [2024-10-14 05:15:36,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18407 to 14294. [2024-10-14 05:15:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14294 states, 12792 states have (on average 1.5983427141963726) internal successors, (20446), 12858 states have internal predecessors, (20446), 1047 states have call successors, (1047), 391 states have call predecessors, (1047), 454 states have return successors, (1838), 1108 states have call predecessors, (1838), 1045 states have call successors, (1838) [2024-10-14 05:15:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14294 states to 14294 states and 23331 transitions. [2024-10-14 05:15:36,692 INFO L78 Accepts]: Start accepts. Automaton has 14294 states and 23331 transitions. Word has length 112 [2024-10-14 05:15:36,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:36,693 INFO L471 AbstractCegarLoop]: Abstraction has 14294 states and 23331 transitions. [2024-10-14 05:15:36,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:36,693 INFO L276 IsEmpty]: Start isEmpty. Operand 14294 states and 23331 transitions. [2024-10-14 05:15:36,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:15:36,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:36,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:15:36,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 05:15:36,703 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:36,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:36,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1986382524, now seen corresponding path program 1 times [2024-10-14 05:15:36,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:36,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031250925] [2024-10-14 05:15:36,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:36,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:36,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:36,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:36,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:15:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:36,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:15:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:36,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:15:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:36,826 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-14 05:15:36,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:36,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031250925] [2024-10-14 05:15:36,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031250925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:36,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:36,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:15:36,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895427938] [2024-10-14 05:15:36,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:36,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:15:36,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:36,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:15:36,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:15:36,828 INFO L87 Difference]: Start difference. First operand 14294 states and 23331 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:40,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:40,728 INFO L93 Difference]: Finished difference Result 56509 states and 93251 transitions. [2024-10-14 05:15:40,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:15:40,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-14 05:15:40,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:40,867 INFO L225 Difference]: With dead ends: 56509 [2024-10-14 05:15:40,868 INFO L226 Difference]: Without dead ends: 42229 [2024-10-14 05:15:40,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:15:40,913 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 1019 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 2727 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:40,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 1417 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2727 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 05:15:40,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42229 states. [2024-10-14 05:15:42,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42229 to 28327. [2024-10-14 05:15:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28327 states, 25417 states have (on average 1.5989298501003266) internal successors, (40640), 25547 states have internal predecessors, (40640), 2007 states have call successors, (2007), 775 states have call predecessors, (2007), 902 states have return successors, (4320), 2132 states have call predecessors, (4320), 2005 states have call successors, (4320) [2024-10-14 05:15:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28327 states to 28327 states and 46967 transitions. [2024-10-14 05:15:43,144 INFO L78 Accepts]: Start accepts. Automaton has 28327 states and 46967 transitions. Word has length 112 [2024-10-14 05:15:43,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:43,146 INFO L471 AbstractCegarLoop]: Abstraction has 28327 states and 46967 transitions. [2024-10-14 05:15:43,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:43,146 INFO L276 IsEmpty]: Start isEmpty. Operand 28327 states and 46967 transitions. [2024-10-14 05:15:43,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:15:43,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:43,169 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:15:43,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 05:15:43,169 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:43,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:43,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1313891074, now seen corresponding path program 1 times [2024-10-14 05:15:43,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:43,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637058049] [2024-10-14 05:15:43,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:43,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:43,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:43,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:43,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:15:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:43,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:15:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:43,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:15:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:43,321 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-14 05:15:43,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:43,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637058049] [2024-10-14 05:15:43,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637058049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:43,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:43,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:15:43,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355322018] [2024-10-14 05:15:43,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:43,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:15:43,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:43,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:15:43,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:15:43,324 INFO L87 Difference]: Start difference. First operand 28327 states and 46967 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:15:49,750 INFO L93 Difference]: Finished difference Result 110572 states and 185257 transitions. [2024-10-14 05:15:49,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:15:49,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-14 05:15:49,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:15:50,032 INFO L225 Difference]: With dead ends: 110572 [2024-10-14 05:15:50,032 INFO L226 Difference]: Without dead ends: 82259 [2024-10-14 05:15:50,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:15:50,116 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 1176 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 2339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 05:15:50,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 1413 Invalid, 2339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 05:15:50,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82259 states. [2024-10-14 05:15:54,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82259 to 55112. [2024-10-14 05:15:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55112 states, 49450 states have (on average 1.5945399393326594) internal successors, (78850), 49708 states have internal predecessors, (78850), 3863 states have call successors, (3863), 1543 states have call predecessors, (3863), 1798 states have return successors, (10678), 4116 states have call predecessors, (10678), 3861 states have call successors, (10678) [2024-10-14 05:15:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55112 states to 55112 states and 93391 transitions. [2024-10-14 05:15:54,706 INFO L78 Accepts]: Start accepts. Automaton has 55112 states and 93391 transitions. Word has length 112 [2024-10-14 05:15:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:15:54,707 INFO L471 AbstractCegarLoop]: Abstraction has 55112 states and 93391 transitions. [2024-10-14 05:15:54,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-14 05:15:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 55112 states and 93391 transitions. [2024-10-14 05:15:54,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 05:15:54,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:15:54,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:15:54,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 05:15:54,741 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:15:54,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:15:54,742 INFO L85 PathProgramCache]: Analyzing trace with hash 727614852, now seen corresponding path program 1 times [2024-10-14 05:15:54,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:15:54,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663592198] [2024-10-14 05:15:54,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:15:54,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:15:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 05:15:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 05:15:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 05:15:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 05:15:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 05:15:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:15:54,866 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-14 05:15:54,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:15:54,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663592198] [2024-10-14 05:15:54,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663592198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:15:54,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:15:54,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:15:54,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983306213] [2024-10-14 05:15:54,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:15:54,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 05:15:54,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:15:54,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 05:15:54,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 05:15:54,868 INFO L87 Difference]: Start difference. First operand 55112 states and 93391 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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-14 05:16:04,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:16:04,948 INFO L93 Difference]: Finished difference Result 213067 states and 364863 transitions. [2024-10-14 05:16:04,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 05:16:04,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (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 112 [2024-10-14 05:16:04,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:16:05,795 INFO L225 Difference]: With dead ends: 213067 [2024-10-14 05:16:05,796 INFO L226 Difference]: Without dead ends: 157969 [2024-10-14 05:16:05,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 05:16:05,936 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 999 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 2618 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 2677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 05:16:05,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 1417 Invalid, 2677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2618 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 05:16:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157969 states.