./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.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 d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 17:15:31,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:15:31,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:15:31,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:15:31,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:15:31,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:15:31,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:15:31,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:15:31,455 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:15:31,455 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:15:31,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:15:31,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:15:31,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:15:31,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:15:31,457 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:15:31,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:15:31,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:15:31,458 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:15:31,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:15:31,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:15:31,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:15:31,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:15:31,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:15:31,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:15:31,462 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:15:31,462 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:15:31,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:15:31,463 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:15:31,463 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:15:31,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:15:31,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:15:31,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:15:31,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:15:31,464 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:15:31,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:15:31,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:15:31,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:15:31,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:15:31,465 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:15:31,465 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:15:31,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:15:31,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:15:31,473 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 -> d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d [2024-11-08 17:15:31,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:15:31,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:15:31,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:15:31,688 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:15:31,688 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:15:31,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2024-11-08 17:15:32,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:15:33,066 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:15:33,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2024-11-08 17:15:33,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52bde2d93/2f64efe8d5ef426a960e0d231bc5a6c5/FLAG871cc1fd7 [2024-11-08 17:15:33,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52bde2d93/2f64efe8d5ef426a960e0d231bc5a6c5 [2024-11-08 17:15:33,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:15:33,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:15:33,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:15:33,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:15:33,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:15:33,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:15:33" (1/1) ... [2024-11-08 17:15:33,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@676eeff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:33, skipping insertion in model container [2024-11-08 17:15:33,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:15:33" (1/1) ... [2024-11-08 17:15:33,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:15:33,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2024-11-08 17:15:33,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2024-11-08 17:15:33,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:15:33,328 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:15:33,337 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2024-11-08 17:15:33,360 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2024-11-08 17:15:33,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:15:33,393 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:15:33,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:33 WrapperNode [2024-11-08 17:15:33,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:15:33,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:15:33,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:15:33,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:15:33,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:33" (1/1) ... [2024-11-08 17:15:33,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:33" (1/1) ... [2024-11-08 17:15:33,437 INFO L138 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 414 [2024-11-08 17:15:33,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:15:33,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:15:33,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:15:33,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:15:33,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:33" (1/1) ... [2024-11-08 17:15:33,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:33" (1/1) ... [2024-11-08 17:15:33,448 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:33" (1/1) ... [2024-11-08 17:15:33,458 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-11-08 17:15:33,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:33" (1/1) ... [2024-11-08 17:15:33,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:33" (1/1) ... [2024-11-08 17:15:33,464 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:33" (1/1) ... [2024-11-08 17:15:33,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:33" (1/1) ... [2024-11-08 17:15:33,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:33" (1/1) ... [2024-11-08 17:15:33,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:33" (1/1) ... [2024-11-08 17:15:33,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:15:33,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:15:33,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:15:33,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:15:33,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:33" (1/1) ... [2024-11-08 17:15:33,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:15:33,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 17:15:33,516 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-11-08 17:15:33,521 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-11-08 17:15:33,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:15:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-08 17:15:33,553 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-08 17:15:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-08 17:15:33,553 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-08 17:15:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-08 17:15:33,553 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-08 17:15:33,553 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-08 17:15:33,553 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-08 17:15:33,554 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-08 17:15:33,554 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-08 17:15:33,554 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-08 17:15:33,554 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-08 17:15:33,554 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-08 17:15:33,554 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-08 17:15:33,554 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-08 17:15:33,554 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-08 17:15:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-08 17:15:33,555 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-08 17:15:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-08 17:15:33,555 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-08 17:15:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-08 17:15:33,555 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-08 17:15:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:15:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-08 17:15:33,556 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-08 17:15:33,556 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-08 17:15:33,556 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-08 17:15:33,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:15:33,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:15:33,556 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-08 17:15:33,556 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-08 17:15:33,556 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-08 17:15:33,556 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-08 17:15:33,645 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:15:33,647 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:15:34,017 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-11-08 17:15:34,018 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:15:34,042 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:15:34,042 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-08 17:15:34,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:15:34 BoogieIcfgContainer [2024-11-08 17:15:34,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:15:34,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:15:34,044 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:15:34,047 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:15:34,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:15:33" (1/3) ... [2024-11-08 17:15:34,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473cae10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:15:34, skipping insertion in model container [2024-11-08 17:15:34,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:15:33" (2/3) ... [2024-11-08 17:15:34,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473cae10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:15:34, skipping insertion in model container [2024-11-08 17:15:34,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:15:34" (3/3) ... [2024-11-08 17:15:34,049 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2024-11-08 17:15:34,060 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:15:34,061 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 17:15:34,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:15:34,113 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;@b90e4e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:15:34,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 17:15:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 218 states, 169 states have (on average 1.5384615384615385) internal successors, (260), 177 states have internal predecessors, (260), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-08 17:15:34,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 17:15:34,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:34,126 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-11-08 17:15:34,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:34,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1543295368, now seen corresponding path program 1 times [2024-11-08 17:15:34,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:34,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563115893] [2024-11-08 17:15:34,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:34,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:34,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:34,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:15:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:34,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:15:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:34,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:15:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:34,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:15:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:34,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:34,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563115893] [2024-11-08 17:15:34,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563115893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:34,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:34,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:15:34,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447487114] [2024-11-08 17:15:34,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:34,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:15:34,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:34,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:15:34,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:15:34,569 INFO L87 Difference]: Start difference. First operand has 218 states, 169 states have (on average 1.5384615384615385) internal successors, (260), 177 states have internal predecessors, (260), 31 states have call successors, (31), 15 states have call predecessors, (31), 15 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-11-08 17:15:35,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:35,266 INFO L93 Difference]: Finished difference Result 558 states and 838 transitions. [2024-11-08 17:15:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:15:35,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 58 [2024-11-08 17:15:35,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:35,279 INFO L225 Difference]: With dead ends: 558 [2024-11-08 17:15:35,279 INFO L226 Difference]: Without dead ends: 347 [2024-11-08 17:15:35,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:15:35,285 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 542 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:35,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 687 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:15:35,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-08 17:15:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 304. [2024-11-08 17:15:35,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 241 states have (on average 1.4481327800829875) internal successors, (349), 247 states have internal predecessors, (349), 41 states have call successors, (41), 21 states have call predecessors, (41), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2024-11-08 17:15:35,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 430 transitions. [2024-11-08 17:15:35,367 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 430 transitions. Word has length 58 [2024-11-08 17:15:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:35,368 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 430 transitions. [2024-11-08 17:15:35,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-11-08 17:15:35,368 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2024-11-08 17:15:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 17:15:35,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:35,372 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-11-08 17:15:35,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:15:35,372 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:35,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:35,373 INFO L85 PathProgramCache]: Analyzing trace with hash -957412732, now seen corresponding path program 1 times [2024-11-08 17:15:35,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:35,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938419098] [2024-11-08 17:15:35,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:35,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:35,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:35,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:15:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:35,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:15:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:35,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:15:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:35,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:15:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:35,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:35,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:35,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938419098] [2024-11-08 17:15:35,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938419098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:35,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:35,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:35,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275173204] [2024-11-08 17:15:35,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:35,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:35,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:35,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:35,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:35,531 INFO L87 Difference]: Start difference. First operand 304 states and 430 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-11-08 17:15:36,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:36,234 INFO L93 Difference]: Finished difference Result 661 states and 944 transitions. [2024-11-08 17:15:36,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:15:36,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 58 [2024-11-08 17:15:36,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:36,238 INFO L225 Difference]: With dead ends: 661 [2024-11-08 17:15:36,238 INFO L226 Difference]: Without dead ends: 462 [2024-11-08 17:15:36,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-08 17:15:36,240 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 521 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:36,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1037 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:15:36,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-08 17:15:36,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 396. [2024-11-08 17:15:36,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 316 states have (on average 1.4430379746835442) internal successors, (456), 323 states have internal predecessors, (456), 51 states have call successors, (51), 27 states have call predecessors, (51), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2024-11-08 17:15:36,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 559 transitions. [2024-11-08 17:15:36,287 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 559 transitions. Word has length 58 [2024-11-08 17:15:36,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:36,288 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 559 transitions. [2024-11-08 17:15:36,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-11-08 17:15:36,288 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 559 transitions. [2024-11-08 17:15:36,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 17:15:36,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:36,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:36,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:15:36,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:36,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:36,293 INFO L85 PathProgramCache]: Analyzing trace with hash -63926394, now seen corresponding path program 1 times [2024-11-08 17:15:36,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:36,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367170086] [2024-11-08 17:15:36,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:36,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:36,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:36,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:15:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:36,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:15:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:36,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:15:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:36,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:15:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:36,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:36,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:36,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367170086] [2024-11-08 17:15:36,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367170086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:36,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:36,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:36,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701353194] [2024-11-08 17:15:36,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:36,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:36,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:36,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:36,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:36,393 INFO L87 Difference]: Start difference. First operand 396 states and 559 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-11-08 17:15:37,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:37,130 INFO L93 Difference]: Finished difference Result 1018 states and 1447 transitions. [2024-11-08 17:15:37,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 17:15:37,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 58 [2024-11-08 17:15:37,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:37,134 INFO L225 Difference]: With dead ends: 1018 [2024-11-08 17:15:37,135 INFO L226 Difference]: Without dead ends: 727 [2024-11-08 17:15:37,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-08 17:15:37,136 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 535 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:37,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 1025 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 17:15:37,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-11-08 17:15:37,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 575. [2024-11-08 17:15:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 463 states have (on average 1.4406047516198703) internal successors, (667), 472 states have internal predecessors, (667), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-11-08 17:15:37,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 814 transitions. [2024-11-08 17:15:37,170 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 814 transitions. Word has length 58 [2024-11-08 17:15:37,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:37,171 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 814 transitions. [2024-11-08 17:15:37,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-11-08 17:15:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 814 transitions. [2024-11-08 17:15:37,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 17:15:37,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:37,175 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-11-08 17:15:37,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:15:37,175 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:37,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:37,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2113314236, now seen corresponding path program 1 times [2024-11-08 17:15:37,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:37,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808865750] [2024-11-08 17:15:37,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:37,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:15:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:15:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:15:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:15:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:37,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:37,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808865750] [2024-11-08 17:15:37,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808865750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:37,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:37,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:37,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794346122] [2024-11-08 17:15:37,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:37,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:37,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:37,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:37,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:37,313 INFO L87 Difference]: Start difference. First operand 575 states and 814 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-11-08 17:15:37,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:37,752 INFO L93 Difference]: Finished difference Result 1137 states and 1635 transitions. [2024-11-08 17:15:37,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:15:37,752 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 58 [2024-11-08 17:15:37,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:37,755 INFO L225 Difference]: With dead ends: 1137 [2024-11-08 17:15:37,755 INFO L226 Difference]: Without dead ends: 668 [2024-11-08 17:15:37,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:15:37,757 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 214 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:37,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 908 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:15:37,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-08 17:15:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 590. [2024-11-08 17:15:37,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 478 states have (on average 1.4267782426778242) internal successors, (682), 487 states have internal predecessors, (682), 69 states have call successors, (69), 39 states have call predecessors, (69), 41 states have return successors, (78), 68 states have call predecessors, (78), 65 states have call successors, (78) [2024-11-08 17:15:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 829 transitions. [2024-11-08 17:15:37,782 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 829 transitions. Word has length 58 [2024-11-08 17:15:37,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:37,783 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 829 transitions. [2024-11-08 17:15:37,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-11-08 17:15:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 829 transitions. [2024-11-08 17:15:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 17:15:37,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:37,784 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-11-08 17:15:37,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:15:37,784 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:37,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:37,785 INFO L85 PathProgramCache]: Analyzing trace with hash -62330238, now seen corresponding path program 1 times [2024-11-08 17:15:37,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:37,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139427724] [2024-11-08 17:15:37,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:37,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:15:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:15:37,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:15:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:15:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:37,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:37,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:37,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139427724] [2024-11-08 17:15:37,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139427724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:37,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:37,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:15:37,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15906659] [2024-11-08 17:15:37,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:37,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:15:37,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:37,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:15:37,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:15:37,888 INFO L87 Difference]: Start difference. First operand 590 states and 829 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-11-08 17:15:38,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:38,442 INFO L93 Difference]: Finished difference Result 1684 states and 2380 transitions. [2024-11-08 17:15:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:15:38,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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 58 [2024-11-08 17:15:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:38,448 INFO L225 Difference]: With dead ends: 1684 [2024-11-08 17:15:38,448 INFO L226 Difference]: Without dead ends: 1200 [2024-11-08 17:15:38,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:15:38,451 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 687 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:38,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 791 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:15:38,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2024-11-08 17:15:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1035. [2024-11-08 17:15:38,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 843 states have (on average 1.4139976275207593) internal successors, (1192), 856 states have internal predecessors, (1192), 115 states have call successors, (115), 69 states have call predecessors, (115), 75 states have return successors, (134), 114 states have call predecessors, (134), 111 states have call successors, (134) [2024-11-08 17:15:38,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1441 transitions. [2024-11-08 17:15:38,502 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1441 transitions. Word has length 58 [2024-11-08 17:15:38,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:38,503 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1441 transitions. [2024-11-08 17:15:38,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 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-11-08 17:15:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1441 transitions. [2024-11-08 17:15:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 17:15:38,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:38,504 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-11-08 17:15:38,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:15:38,504 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:38,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:38,504 INFO L85 PathProgramCache]: Analyzing trace with hash 856644385, now seen corresponding path program 1 times [2024-11-08 17:15:38,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:38,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059837098] [2024-11-08 17:15:38,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:38,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:38,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:38,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:15:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:38,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:15:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:38,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:15:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:38,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:15:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:38,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:38,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059837098] [2024-11-08 17:15:38,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059837098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:38,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:38,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:38,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710663039] [2024-11-08 17:15:38,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:38,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:38,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:38,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:38,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:38,564 INFO L87 Difference]: Start difference. First operand 1035 states and 1441 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-11-08 17:15:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:39,026 INFO L93 Difference]: Finished difference Result 2145 states and 3018 transitions. [2024-11-08 17:15:39,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:15:39,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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 58 [2024-11-08 17:15:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:39,030 INFO L225 Difference]: With dead ends: 2145 [2024-11-08 17:15:39,031 INFO L226 Difference]: Without dead ends: 1216 [2024-11-08 17:15:39,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:15:39,035 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 219 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:39,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 904 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:15:39,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-11-08 17:15:39,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1050. [2024-11-08 17:15:39,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 858 states have (on average 1.400932400932401) internal successors, (1202), 871 states have internal predecessors, (1202), 115 states have call successors, (115), 69 states have call predecessors, (115), 75 states have return successors, (134), 114 states have call predecessors, (134), 111 states have call successors, (134) [2024-11-08 17:15:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1451 transitions. [2024-11-08 17:15:39,081 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1451 transitions. Word has length 58 [2024-11-08 17:15:39,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:39,082 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1451 transitions. [2024-11-08 17:15:39,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 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-11-08 17:15:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1451 transitions. [2024-11-08 17:15:39,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 17:15:39,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:39,083 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-11-08 17:15:39,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:15:39,084 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:39,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:39,084 INFO L85 PathProgramCache]: Analyzing trace with hash 347171295, now seen corresponding path program 1 times [2024-11-08 17:15:39,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:39,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415447446] [2024-11-08 17:15:39,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:39,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:39,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:39,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:15:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:39,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:15:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:39,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:15:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:39,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:15:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:39,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:39,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415447446] [2024-11-08 17:15:39,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415447446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:39,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:39,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:15:39,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958123146] [2024-11-08 17:15:39,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:39,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:15:39,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:39,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:15:39,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:15:39,192 INFO L87 Difference]: Start difference. First operand 1050 states and 1451 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:39,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:39,792 INFO L93 Difference]: Finished difference Result 1630 states and 2245 transitions. [2024-11-08 17:15:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:15:39,792 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-08 17:15:39,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:39,796 INFO L225 Difference]: With dead ends: 1630 [2024-11-08 17:15:39,797 INFO L226 Difference]: Without dead ends: 1044 [2024-11-08 17:15:39,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:15:39,800 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 598 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:39,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 899 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:15:39,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2024-11-08 17:15:39,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 856. [2024-11-08 17:15:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 698 states have (on average 1.3925501432664757) internal successors, (972), 707 states have internal predecessors, (972), 97 states have call successors, (97), 57 states have call predecessors, (97), 59 states have return successors, (100), 94 states have call predecessors, (100), 93 states have call successors, (100) [2024-11-08 17:15:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1169 transitions. [2024-11-08 17:15:39,851 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1169 transitions. Word has length 58 [2024-11-08 17:15:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:39,852 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1169 transitions. [2024-11-08 17:15:39,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1169 transitions. [2024-11-08 17:15:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 17:15:39,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:39,853 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-11-08 17:15:39,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:15:39,854 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:39,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:39,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1458267039, now seen corresponding path program 1 times [2024-11-08 17:15:39,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:39,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717927842] [2024-11-08 17:15:39,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:39,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:39,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:39,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:15:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:39,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:15:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:39,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:15:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:39,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:15:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:39,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:39,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717927842] [2024-11-08 17:15:39,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717927842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:39,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:39,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:15:39,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802914896] [2024-11-08 17:15:39,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:39,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:15:39,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:39,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:15:39,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:15:39,966 INFO L87 Difference]: Start difference. First operand 856 states and 1169 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:40,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:40,619 INFO L93 Difference]: Finished difference Result 1553 states and 2114 transitions. [2024-11-08 17:15:40,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:15:40,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-08 17:15:40,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:40,623 INFO L225 Difference]: With dead ends: 1553 [2024-11-08 17:15:40,624 INFO L226 Difference]: Without dead ends: 978 [2024-11-08 17:15:40,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:15:40,626 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 604 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:40,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 896 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:15:40,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-11-08 17:15:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 767. [2024-11-08 17:15:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 626 states have (on average 1.3929712460063899) internal successors, (872), 633 states have internal predecessors, (872), 88 states have call successors, (88), 51 states have call predecessors, (88), 51 states have return successors, (86), 84 states have call predecessors, (86), 84 states have call successors, (86) [2024-11-08 17:15:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1046 transitions. [2024-11-08 17:15:40,677 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1046 transitions. Word has length 58 [2024-11-08 17:15:40,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:40,677 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1046 transitions. [2024-11-08 17:15:40,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1046 transitions. [2024-11-08 17:15:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 17:15:40,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:40,678 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-11-08 17:15:40,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:15:40,678 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:40,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:40,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1239412321, now seen corresponding path program 1 times [2024-11-08 17:15:40,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:40,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064756845] [2024-11-08 17:15:40,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:40,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:40,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:40,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:15:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:40,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:15:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:40,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:15:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:40,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:15:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:40,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:40,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:40,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064756845] [2024-11-08 17:15:40,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064756845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:40,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:40,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:15:40,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246326131] [2024-11-08 17:15:40,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:40,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:15:40,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:40,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:15:40,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:15:40,787 INFO L87 Difference]: Start difference. First operand 767 states and 1046 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:41,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:41,405 INFO L93 Difference]: Finished difference Result 1916 states and 2586 transitions. [2024-11-08 17:15:41,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:15:41,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2024-11-08 17:15:41,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:41,410 INFO L225 Difference]: With dead ends: 1916 [2024-11-08 17:15:41,410 INFO L226 Difference]: Without dead ends: 1256 [2024-11-08 17:15:41,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2024-11-08 17:15:41,411 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 732 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:41,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 784 Invalid, 923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:15:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2024-11-08 17:15:41,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 998. [2024-11-08 17:15:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 813 states have (on average 1.3628536285362853) internal successors, (1108), 823 states have internal predecessors, (1108), 113 states have call successors, (113), 67 states have call predecessors, (113), 70 states have return successors, (118), 110 states have call predecessors, (118), 109 states have call successors, (118) [2024-11-08 17:15:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1339 transitions. [2024-11-08 17:15:41,450 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1339 transitions. Word has length 58 [2024-11-08 17:15:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:41,451 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1339 transitions. [2024-11-08 17:15:41,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 17:15:41,451 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1339 transitions. [2024-11-08 17:15:41,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-08 17:15:41,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:41,454 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-11-08 17:15:41,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:15:41,454 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:41,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:41,455 INFO L85 PathProgramCache]: Analyzing trace with hash -816710495, now seen corresponding path program 1 times [2024-11-08 17:15:41,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:41,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849599436] [2024-11-08 17:15:41,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:41,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:41,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:41,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:15:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:41,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:15:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:41,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:15:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:41,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:15:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:41,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:41,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849599436] [2024-11-08 17:15:41,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849599436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:41,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:41,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:15:41,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015886720] [2024-11-08 17:15:41,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:41,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:15:41,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:41,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:15:41,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:15:41,495 INFO L87 Difference]: Start difference. First operand 998 states and 1339 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 17:15:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:41,886 INFO L93 Difference]: Finished difference Result 2657 states and 3573 transitions. [2024-11-08 17:15:41,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:15:41,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2024-11-08 17:15:41,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:41,893 INFO L225 Difference]: With dead ends: 2657 [2024-11-08 17:15:41,893 INFO L226 Difference]: Without dead ends: 1766 [2024-11-08 17:15:41,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:15:41,895 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 543 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:41,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 497 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:15:41,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1766 states. [2024-11-08 17:15:41,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1766 to 1551. [2024-11-08 17:15:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1254 states have (on average 1.335725677830941) internal successors, (1675), 1273 states have internal predecessors, (1675), 181 states have call successors, (181), 109 states have call predecessors, (181), 114 states have return successors, (188), 171 states have call predecessors, (188), 177 states have call successors, (188) [2024-11-08 17:15:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2044 transitions. [2024-11-08 17:15:41,959 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2044 transitions. Word has length 58 [2024-11-08 17:15:41,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:41,960 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2044 transitions. [2024-11-08 17:15:41,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 17:15:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2044 transitions. [2024-11-08 17:15:41,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 17:15:41,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:41,961 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] [2024-11-08 17:15:41,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:15:41,961 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:41,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:41,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1865041758, now seen corresponding path program 1 times [2024-11-08 17:15:41,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:41,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377685406] [2024-11-08 17:15:41,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:41,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:41,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:42,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 17:15:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:42,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:15:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:42,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 17:15:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:42,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:42,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:15:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:42,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:15:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:42,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:42,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:42,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377685406] [2024-11-08 17:15:42,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377685406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:42,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:42,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:15:42,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167843097] [2024-11-08 17:15:42,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:42,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:15:42,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:42,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:15:42,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:15:42,030 INFO L87 Difference]: Start difference. First operand 1551 states and 2044 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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-11-08 17:15:42,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:42,593 INFO L93 Difference]: Finished difference Result 1774 states and 2359 transitions. [2024-11-08 17:15:42,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:15:42,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2024-11-08 17:15:42,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:42,600 INFO L225 Difference]: With dead ends: 1774 [2024-11-08 17:15:42,600 INFO L226 Difference]: Without dead ends: 1686 [2024-11-08 17:15:42,601 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-11-08 17:15:42,601 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 417 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:42,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 857 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:15:42,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2024-11-08 17:15:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1647. [2024-11-08 17:15:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1330 states have (on average 1.3383458646616542) internal successors, (1780), 1351 states have internal predecessors, (1780), 192 states have call successors, (192), 116 states have call predecessors, (192), 123 states have return successors, (204), 183 states have call predecessors, (204), 188 states have call successors, (204) [2024-11-08 17:15:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2176 transitions. [2024-11-08 17:15:42,697 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2176 transitions. Word has length 65 [2024-11-08 17:15:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:42,697 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2176 transitions. [2024-11-08 17:15:42,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 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-11-08 17:15:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2176 transitions. [2024-11-08 17:15:42,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 17:15:42,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:42,699 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] [2024-11-08 17:15:42,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:15:42,699 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:42,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:42,700 INFO L85 PathProgramCache]: Analyzing trace with hash -751036898, now seen corresponding path program 1 times [2024-11-08 17:15:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:42,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18051659] [2024-11-08 17:15:42,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:42,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:42,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:42,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:42,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 17:15:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:42,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:15:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:42,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 17:15:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:42,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:42,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:15:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:42,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:15:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:42,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:42,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18051659] [2024-11-08 17:15:42,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18051659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:42,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:42,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:15:42,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52166560] [2024-11-08 17:15:42,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:42,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:15:42,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:42,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:15:42,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:15:42,796 INFO L87 Difference]: Start difference. First operand 1647 states and 2176 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-11-08 17:15:43,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:43,413 INFO L93 Difference]: Finished difference Result 1994 states and 2653 transitions. [2024-11-08 17:15:43,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:15:43,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2024-11-08 17:15:43,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:43,421 INFO L225 Difference]: With dead ends: 1994 [2024-11-08 17:15:43,421 INFO L226 Difference]: Without dead ends: 1817 [2024-11-08 17:15:43,422 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-11-08 17:15:43,422 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 690 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:43,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 980 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:15:43,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2024-11-08 17:15:43,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1743. [2024-11-08 17:15:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1406 states have (on average 1.3399715504978662) internal successors, (1884), 1429 states have internal predecessors, (1884), 203 states have call successors, (203), 123 states have call predecessors, (203), 132 states have return successors, (223), 195 states have call predecessors, (223), 199 states have call successors, (223) [2024-11-08 17:15:43,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2310 transitions. [2024-11-08 17:15:43,550 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2310 transitions. Word has length 65 [2024-11-08 17:15:43,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:43,550 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2310 transitions. [2024-11-08 17:15:43,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-11-08 17:15:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2310 transitions. [2024-11-08 17:15:43,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 17:15:43,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:43,552 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] [2024-11-08 17:15:43,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:15:43,553 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:43,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:43,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1515344288, now seen corresponding path program 1 times [2024-11-08 17:15:43,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:43,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295548066] [2024-11-08 17:15:43,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:43,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:43,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:43,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 17:15:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:43,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:15:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:43,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 17:15:43,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:43,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:43,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:15:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:43,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:15:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:43,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:43,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:43,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295548066] [2024-11-08 17:15:43,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295548066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:43,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:43,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:15:43,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323279538] [2024-11-08 17:15:43,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:43,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:15:43,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:43,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:15:43,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:15:43,650 INFO L87 Difference]: Start difference. First operand 1743 states and 2310 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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-11-08 17:15:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:44,172 INFO L93 Difference]: Finished difference Result 2042 states and 2721 transitions. [2024-11-08 17:15:44,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:15:44,172 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2024-11-08 17:15:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:44,179 INFO L225 Difference]: With dead ends: 2042 [2024-11-08 17:15:44,179 INFO L226 Difference]: Without dead ends: 1775 [2024-11-08 17:15:44,180 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-11-08 17:15:44,180 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 210 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:44,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1206 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:15:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2024-11-08 17:15:44,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1748. [2024-11-08 17:15:44,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1410 states have (on average 1.3375886524822695) internal successors, (1886), 1433 states have internal predecessors, (1886), 203 states have call successors, (203), 123 states have call predecessors, (203), 133 states have return successors, (224), 196 states have call predecessors, (224), 199 states have call successors, (224) [2024-11-08 17:15:44,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2313 transitions. [2024-11-08 17:15:44,264 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2313 transitions. Word has length 65 [2024-11-08 17:15:44,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:44,265 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 2313 transitions. [2024-11-08 17:15:44,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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-11-08 17:15:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2313 transitions. [2024-11-08 17:15:44,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 17:15:44,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:44,267 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] [2024-11-08 17:15:44,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:15:44,267 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:44,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:44,267 INFO L85 PathProgramCache]: Analyzing trace with hash 485984990, now seen corresponding path program 1 times [2024-11-08 17:15:44,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:44,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235977444] [2024-11-08 17:15:44,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:44,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:44,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:44,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 17:15:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:44,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:15:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:44,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 17:15:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:44,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:44,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:15:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:44,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:15:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:44,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:44,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235977444] [2024-11-08 17:15:44,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235977444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:44,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:44,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:15:44,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121215009] [2024-11-08 17:15:44,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:44,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:15:44,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:44,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:15:44,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:15:44,387 INFO L87 Difference]: Start difference. First operand 1748 states and 2313 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 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-11-08 17:15:45,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:45,463 INFO L93 Difference]: Finished difference Result 3410 states and 4585 transitions. [2024-11-08 17:15:45,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-08 17:15:45,464 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2024-11-08 17:15:45,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:45,474 INFO L225 Difference]: With dead ends: 3410 [2024-11-08 17:15:45,474 INFO L226 Difference]: Without dead ends: 3138 [2024-11-08 17:15:45,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-08 17:15:45,476 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1596 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 1139 SdHoareTripleChecker+Invalid, 1563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:45,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 1139 Invalid, 1563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:15:45,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2024-11-08 17:15:45,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2888. [2024-11-08 17:15:45,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 2310 states have (on average 1.3277056277056276) internal successors, (3067), 2353 states have internal predecessors, (3067), 320 states have call successors, (320), 225 states have call predecessors, (320), 256 states have return successors, (410), 314 states have call predecessors, (410), 316 states have call successors, (410) [2024-11-08 17:15:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 3797 transitions. [2024-11-08 17:15:45,712 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 3797 transitions. Word has length 65 [2024-11-08 17:15:45,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:45,712 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 3797 transitions. [2024-11-08 17:15:45,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 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-11-08 17:15:45,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 3797 transitions. [2024-11-08 17:15:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 17:15:45,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:45,713 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] [2024-11-08 17:15:45,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:15:45,714 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:45,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:45,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1537434079, now seen corresponding path program 1 times [2024-11-08 17:15:45,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:45,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126031153] [2024-11-08 17:15:45,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:45,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:45,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 17:15:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:45,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:15:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:45,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 17:15:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:45,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:45,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:15:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:45,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:15:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:45,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:45,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126031153] [2024-11-08 17:15:45,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126031153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:45,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:45,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:15:45,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478733809] [2024-11-08 17:15:45,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:45,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:15:45,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:45,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:15:45,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:15:45,793 INFO L87 Difference]: Start difference. First operand 2888 states and 3797 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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-11-08 17:15:46,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:46,346 INFO L93 Difference]: Finished difference Result 4485 states and 5916 transitions. [2024-11-08 17:15:46,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:15:46,346 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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 65 [2024-11-08 17:15:46,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:46,355 INFO L225 Difference]: With dead ends: 4485 [2024-11-08 17:15:46,356 INFO L226 Difference]: Without dead ends: 3073 [2024-11-08 17:15:46,358 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-11-08 17:15:46,359 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 311 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:46,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1077 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:15:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2024-11-08 17:15:46,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 2933. [2024-11-08 17:15:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2933 states, 2346 states have (on average 1.318840579710145) internal successors, (3094), 2389 states have internal predecessors, (3094), 320 states have call successors, (320), 225 states have call predecessors, (320), 265 states have return successors, (422), 323 states have call predecessors, (422), 316 states have call successors, (422) [2024-11-08 17:15:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2933 states to 2933 states and 3836 transitions. [2024-11-08 17:15:46,550 INFO L78 Accepts]: Start accepts. Automaton has 2933 states and 3836 transitions. Word has length 65 [2024-11-08 17:15:46,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:46,551 INFO L471 AbstractCegarLoop]: Abstraction has 2933 states and 3836 transitions. [2024-11-08 17:15:46,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 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-11-08 17:15:46,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2933 states and 3836 transitions. [2024-11-08 17:15:46,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 17:15:46,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:46,552 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] [2024-11-08 17:15:46,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:15:46,552 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:46,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:46,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1371329823, now seen corresponding path program 1 times [2024-11-08 17:15:46,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:46,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592721959] [2024-11-08 17:15:46,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:46,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:46,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:46,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 17:15:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:46,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:15:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:46,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 17:15:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:46,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:46,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:15:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:46,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:15:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:46,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:46,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:46,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592721959] [2024-11-08 17:15:46,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592721959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:46,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:46,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:15:46,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107705612] [2024-11-08 17:15:46,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:46,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:15:46,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:46,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:15:46,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:15:46,647 INFO L87 Difference]: Start difference. First operand 2933 states and 3836 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-11-08 17:15:47,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:47,415 INFO L93 Difference]: Finished difference Result 4368 states and 5675 transitions. [2024-11-08 17:15:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 17:15:47,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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 65 [2024-11-08 17:15:47,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:47,428 INFO L225 Difference]: With dead ends: 4368 [2024-11-08 17:15:47,428 INFO L226 Difference]: Without dead ends: 3131 [2024-11-08 17:15:47,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-08 17:15:47,432 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 578 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:47,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 876 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:15:47,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2024-11-08 17:15:47,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 2911. [2024-11-08 17:15:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2911 states, 2332 states have (on average 1.316466552315609) internal successors, (3070), 2369 states have internal predecessors, (3070), 320 states have call successors, (320), 225 states have call predecessors, (320), 257 states have return successors, (406), 321 states have call predecessors, (406), 316 states have call successors, (406) [2024-11-08 17:15:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 3796 transitions. [2024-11-08 17:15:47,630 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 3796 transitions. Word has length 65 [2024-11-08 17:15:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:47,631 INFO L471 AbstractCegarLoop]: Abstraction has 2911 states and 3796 transitions. [2024-11-08 17:15:47,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 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-11-08 17:15:47,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 3796 transitions. [2024-11-08 17:15:47,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-08 17:15:47,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:47,632 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] [2024-11-08 17:15:47,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 17:15:47,632 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:47,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:47,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1505343329, now seen corresponding path program 1 times [2024-11-08 17:15:47,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:47,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504561090] [2024-11-08 17:15:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:47,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:47,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:47,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 17:15:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:47,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:15:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:47,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 17:15:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:47,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:47,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:15:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:47,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:15:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:47,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:47,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504561090] [2024-11-08 17:15:47,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504561090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:47,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:47,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:47,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067780887] [2024-11-08 17:15:47,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:47,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:47,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:47,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:47,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:47,703 INFO L87 Difference]: Start difference. First operand 2911 states and 3796 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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-11-08 17:15:48,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:48,282 INFO L93 Difference]: Finished difference Result 5986 states and 7775 transitions. [2024-11-08 17:15:48,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:15:48,283 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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 65 [2024-11-08 17:15:48,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:48,296 INFO L225 Difference]: With dead ends: 5986 [2024-11-08 17:15:48,296 INFO L226 Difference]: Without dead ends: 4554 [2024-11-08 17:15:48,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:15:48,299 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 680 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:48,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 601 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:15:48,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2024-11-08 17:15:48,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4282. [2024-11-08 17:15:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4282 states, 3398 states have (on average 1.2910535609181872) internal successors, (4387), 3456 states have internal predecessors, (4387), 472 states have call successors, (472), 348 states have call predecessors, (472), 410 states have return successors, (678), 485 states have call predecessors, (678), 468 states have call successors, (678) [2024-11-08 17:15:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4282 states to 4282 states and 5537 transitions. [2024-11-08 17:15:48,631 INFO L78 Accepts]: Start accepts. Automaton has 4282 states and 5537 transitions. Word has length 65 [2024-11-08 17:15:48,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:48,631 INFO L471 AbstractCegarLoop]: Abstraction has 4282 states and 5537 transitions. [2024-11-08 17:15:48,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 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-11-08 17:15:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 4282 states and 5537 transitions. [2024-11-08 17:15:48,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-08 17:15:48,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:48,635 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] [2024-11-08 17:15:48,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 17:15:48,636 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:48,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:48,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1262306604, now seen corresponding path program 1 times [2024-11-08 17:15:48,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:48,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885187000] [2024-11-08 17:15:48,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:48,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:48,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:48,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 17:15:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:48,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:15:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:48,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 17:15:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:48,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:48,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:15:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:48,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:15:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:48,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:48,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885187000] [2024-11-08 17:15:48,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885187000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:48,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:48,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:15:48,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884862446] [2024-11-08 17:15:48,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:48,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:15:48,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:48,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:15:48,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:15:48,696 INFO L87 Difference]: Start difference. First operand 4282 states and 5537 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 17:15:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:49,438 INFO L93 Difference]: Finished difference Result 9300 states and 12051 transitions. [2024-11-08 17:15:49,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:15:49,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-08 17:15:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:49,459 INFO L225 Difference]: With dead ends: 9300 [2024-11-08 17:15:49,459 INFO L226 Difference]: Without dead ends: 6476 [2024-11-08 17:15:49,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:15:49,467 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 525 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:49,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 595 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:15:49,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6476 states. [2024-11-08 17:15:49,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6476 to 5960. [2024-11-08 17:15:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5960 states, 4683 states have (on average 1.2784539824898569) internal successors, (5987), 4748 states have internal predecessors, (5987), 666 states have call successors, (666), 522 states have call predecessors, (666), 609 states have return successors, (999), 697 states have call predecessors, (999), 662 states have call successors, (999) [2024-11-08 17:15:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5960 states to 5960 states and 7652 transitions. [2024-11-08 17:15:49,924 INFO L78 Accepts]: Start accepts. Automaton has 5960 states and 7652 transitions. Word has length 66 [2024-11-08 17:15:49,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:49,924 INFO L471 AbstractCegarLoop]: Abstraction has 5960 states and 7652 transitions. [2024-11-08 17:15:49,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 17:15:49,924 INFO L276 IsEmpty]: Start isEmpty. Operand 5960 states and 7652 transitions. [2024-11-08 17:15:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-08 17:15:49,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:49,926 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:49,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 17:15:49,926 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:49,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:49,926 INFO L85 PathProgramCache]: Analyzing trace with hash 810620221, now seen corresponding path program 1 times [2024-11-08 17:15:49,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:49,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438030042] [2024-11-08 17:15:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:49,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:49,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:49,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 17:15:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:49,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:15:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:49,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 17:15:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:49,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:49,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:15:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:49,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:15:49,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:49,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:49,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438030042] [2024-11-08 17:15:49,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438030042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:49,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:49,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:15:49,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495991399] [2024-11-08 17:15:49,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:49,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:15:49,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:49,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:15:49,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:15:49,993 INFO L87 Difference]: Start difference. First operand 5960 states and 7652 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-08 17:15:51,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:51,157 INFO L93 Difference]: Finished difference Result 7590 states and 9654 transitions. [2024-11-08 17:15:51,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:15:51,158 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2024-11-08 17:15:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:51,175 INFO L225 Difference]: With dead ends: 7590 [2024-11-08 17:15:51,175 INFO L226 Difference]: Without dead ends: 7587 [2024-11-08 17:15:51,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:15:51,176 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 831 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:51,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 628 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:15:51,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7587 states. [2024-11-08 17:15:51,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7587 to 7014. [2024-11-08 17:15:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7014 states, 5486 states have (on average 1.2681370761939483) internal successors, (6957), 5560 states have internal predecessors, (6957), 792 states have call successors, (792), 636 states have call predecessors, (792), 734 states have return successors, (1192), 825 states have call predecessors, (1192), 789 states have call successors, (1192) [2024-11-08 17:15:51,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 8941 transitions. [2024-11-08 17:15:51,721 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 8941 transitions. Word has length 73 [2024-11-08 17:15:51,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:51,721 INFO L471 AbstractCegarLoop]: Abstraction has 7014 states and 8941 transitions. [2024-11-08 17:15:51,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-08 17:15:51,721 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 8941 transitions. [2024-11-08 17:15:51,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-08 17:15:51,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:51,723 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:51,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 17:15:51,723 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:51,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:51,724 INFO L85 PathProgramCache]: Analyzing trace with hash -641233259, now seen corresponding path program 1 times [2024-11-08 17:15:51,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:51,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036623320] [2024-11-08 17:15:51,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:51,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:51,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:51,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 17:15:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:51,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:15:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:51,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 17:15:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:51,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:51,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:15:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:51,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:15:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:51,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:51,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036623320] [2024-11-08 17:15:51,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036623320] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:15:51,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107156177] [2024-11-08 17:15:51,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:51,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:15:51,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 17:15:51,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:15:51,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:15:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:51,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 17:15:51,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:15:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:52,100 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:15:52,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:52,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107156177] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:15:52,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:15:52,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-11-08 17:15:52,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34851497] [2024-11-08 17:15:52,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:15:52,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:15:52,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:52,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:15:52,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:15:52,180 INFO L87 Difference]: Start difference. First operand 7014 states and 8941 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 17:15:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:54,579 INFO L93 Difference]: Finished difference Result 14660 states and 18469 transitions. [2024-11-08 17:15:54,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 17:15:54,579 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2024-11-08 17:15:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:54,617 INFO L225 Difference]: With dead ends: 14660 [2024-11-08 17:15:54,617 INFO L226 Difference]: Without dead ends: 14657 [2024-11-08 17:15:54,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-11-08 17:15:54,623 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 1137 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:54,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 1300 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:15:54,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14657 states. [2024-11-08 17:15:55,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14657 to 12272. [2024-11-08 17:15:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12272 states, 9578 states have (on average 1.2597619544790144) internal successors, (12066), 9704 states have internal predecessors, (12066), 1358 states have call successors, (1358), 1126 states have call predecessors, (1358), 1334 states have return successors, (2131), 1449 states have call predecessors, (2131), 1355 states have call successors, (2131) [2024-11-08 17:15:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12272 states to 12272 states and 15555 transitions. [2024-11-08 17:15:55,735 INFO L78 Accepts]: Start accepts. Automaton has 12272 states and 15555 transitions. Word has length 74 [2024-11-08 17:15:55,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:55,736 INFO L471 AbstractCegarLoop]: Abstraction has 12272 states and 15555 transitions. [2024-11-08 17:15:55,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 17:15:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 12272 states and 15555 transitions. [2024-11-08 17:15:55,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-08 17:15:55,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:55,738 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:55,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 17:15:55,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:15:55,943 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:55,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:55,944 INFO L85 PathProgramCache]: Analyzing trace with hash 184477117, now seen corresponding path program 2 times [2024-11-08 17:15:55,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:55,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073397287] [2024-11-08 17:15:55,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:55,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:55,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:55,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 17:15:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:55,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:15:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:55,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 17:15:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:55,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:55,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:15:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:55,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:15:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:55,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:15:55,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:55,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073397287] [2024-11-08 17:15:55,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073397287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:55,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:55,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:15:55,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010782184] [2024-11-08 17:15:55,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:55,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:15:55,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:55,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:15:55,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:15:55,987 INFO L87 Difference]: Start difference. First operand 12272 states and 15555 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-08 17:15:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:15:57,120 INFO L93 Difference]: Finished difference Result 18815 states and 23897 transitions. [2024-11-08 17:15:57,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:15:57,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2024-11-08 17:15:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:15:57,147 INFO L225 Difference]: With dead ends: 18815 [2024-11-08 17:15:57,148 INFO L226 Difference]: Without dead ends: 8877 [2024-11-08 17:15:57,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:15:57,167 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 553 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:15:57,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 566 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:15:57,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8877 states. [2024-11-08 17:15:58,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8877 to 8325. [2024-11-08 17:15:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8325 states, 6525 states have (on average 1.2422988505747126) internal successors, (8106), 6607 states have internal predecessors, (8106), 925 states have call successors, (925), 750 states have call predecessors, (925), 873 states have return successors, (1350), 975 states have call predecessors, (1350), 922 states have call successors, (1350) [2024-11-08 17:15:58,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8325 states to 8325 states and 10381 transitions. [2024-11-08 17:15:58,281 INFO L78 Accepts]: Start accepts. Automaton has 8325 states and 10381 transitions. Word has length 77 [2024-11-08 17:15:58,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:15:58,283 INFO L471 AbstractCegarLoop]: Abstraction has 8325 states and 10381 transitions. [2024-11-08 17:15:58,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-08 17:15:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 8325 states and 10381 transitions. [2024-11-08 17:15:58,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-08 17:15:58,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:15:58,286 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:15:58,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 17:15:58,287 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:58,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:58,287 INFO L85 PathProgramCache]: Analyzing trace with hash 877375111, now seen corresponding path program 1 times [2024-11-08 17:15:58,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:15:58,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917894319] [2024-11-08 17:15:58,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:58,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:15:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:58,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:15:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:58,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 17:15:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:58,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:15:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:58,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 17:15:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:58,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:15:58,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:58,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:15:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:58,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:15:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:58,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 17:15:58,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 17:15:58,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:15:58,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917894319] [2024-11-08 17:15:58,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917894319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:15:58,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:15:58,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:15:58,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804181726] [2024-11-08 17:15:58,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:15:58,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:15:58,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:15:58,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:15:58,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:15:58,379 INFO L87 Difference]: Start difference. First operand 8325 states and 10381 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-08 17:16:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:00,720 INFO L93 Difference]: Finished difference Result 22199 states and 27598 transitions. [2024-11-08 17:16:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 17:16:00,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2024-11-08 17:16:00,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:00,769 INFO L225 Difference]: With dead ends: 22199 [2024-11-08 17:16:00,769 INFO L226 Difference]: Without dead ends: 15356 [2024-11-08 17:16:00,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-08 17:16:00,789 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 781 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:00,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 988 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:16:00,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15356 states. [2024-11-08 17:16:02,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15356 to 14497. [2024-11-08 17:16:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14497 states, 11201 states have (on average 1.213552361396304) internal successors, (13593), 11389 states have internal predecessors, (13593), 1641 states have call successors, (1641), 1354 states have call predecessors, (1641), 1653 states have return successors, (2753), 1767 states have call predecessors, (2753), 1638 states have call successors, (2753) [2024-11-08 17:16:02,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14497 states to 14497 states and 17987 transitions. [2024-11-08 17:16:02,142 INFO L78 Accepts]: Start accepts. Automaton has 14497 states and 17987 transitions. Word has length 84 [2024-11-08 17:16:02,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:02,142 INFO L471 AbstractCegarLoop]: Abstraction has 14497 states and 17987 transitions. [2024-11-08 17:16:02,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-08 17:16:02,142 INFO L276 IsEmpty]: Start isEmpty. Operand 14497 states and 17987 transitions. [2024-11-08 17:16:02,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-08 17:16:02,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:02,148 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:16:02,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 17:16:02,148 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:16:02,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:02,148 INFO L85 PathProgramCache]: Analyzing trace with hash 983012091, now seen corresponding path program 1 times [2024-11-08 17:16:02,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:02,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156773145] [2024-11-08 17:16:02,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:02,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:02,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:16:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:02,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 17:16:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:02,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:16:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:02,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 17:16:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:02,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:16:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:02,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:16:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:02,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:16:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:02,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 17:16:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:02,228 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 17:16:02,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:02,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156773145] [2024-11-08 17:16:02,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156773145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:02,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:02,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:16:02,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903833899] [2024-11-08 17:16:02,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:02,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:16:02,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:02,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:16:02,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:16:02,230 INFO L87 Difference]: Start difference. First operand 14497 states and 17987 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-08 17:16:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:04,266 INFO L93 Difference]: Finished difference Result 25371 states and 31306 transitions. [2024-11-08 17:16:04,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 17:16:04,267 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2024-11-08 17:16:04,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:04,307 INFO L225 Difference]: With dead ends: 25371 [2024-11-08 17:16:04,308 INFO L226 Difference]: Without dead ends: 12972 [2024-11-08 17:16:04,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-11-08 17:16:04,331 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 1150 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:04,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 1026 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:16:04,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12972 states. [2024-11-08 17:16:05,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12972 to 12072. [2024-11-08 17:16:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12072 states, 9367 states have (on average 1.2067897939575105) internal successors, (11304), 9522 states have internal predecessors, (11304), 1342 states have call successors, (1342), 1103 states have call predecessors, (1342), 1361 states have return successors, (2085), 1457 states have call predecessors, (2085), 1339 states have call successors, (2085) [2024-11-08 17:16:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12072 states to 12072 states and 14731 transitions. [2024-11-08 17:16:05,943 INFO L78 Accepts]: Start accepts. Automaton has 12072 states and 14731 transitions. Word has length 93 [2024-11-08 17:16:05,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:05,944 INFO L471 AbstractCegarLoop]: Abstraction has 12072 states and 14731 transitions. [2024-11-08 17:16:05,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-08 17:16:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 12072 states and 14731 transitions. [2024-11-08 17:16:05,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:16:05,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:05,948 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:16:05,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 17:16:05,948 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:16:05,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:05,949 INFO L85 PathProgramCache]: Analyzing trace with hash 429787919, now seen corresponding path program 1 times [2024-11-08 17:16:05,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:05,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271174954] [2024-11-08 17:16:05,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:05,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:05,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:16:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:05,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:16:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:06,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:16:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:06,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:16:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:06,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:16:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:06,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:16:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:06,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-08 17:16:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:06,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:16:06,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 17:16:06,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:06,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271174954] [2024-11-08 17:16:06,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271174954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:06,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:06,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:16:06,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616785547] [2024-11-08 17:16:06,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:06,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:16:06,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:06,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:16:06,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:16:06,083 INFO L87 Difference]: Start difference. First operand 12072 states and 14731 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 17:16:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:07,577 INFO L93 Difference]: Finished difference Result 15284 states and 19059 transitions. [2024-11-08 17:16:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:16:07,577 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 94 [2024-11-08 17:16:07,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:07,619 INFO L225 Difference]: With dead ends: 15284 [2024-11-08 17:16:07,619 INFO L226 Difference]: Without dead ends: 13842 [2024-11-08 17:16:07,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:16:07,629 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 605 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:07,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 688 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:16:07,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13842 states. [2024-11-08 17:16:08,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13842 to 13447. [2024-11-08 17:16:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13447 states, 10462 states have (on average 1.2163066335308736) internal successors, (12725), 10642 states have internal predecessors, (12725), 1498 states have call successors, (1498), 1202 states have call predecessors, (1498), 1485 states have return successors, (2338), 1615 states have call predecessors, (2338), 1495 states have call successors, (2338) [2024-11-08 17:16:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13447 states to 13447 states and 16561 transitions. [2024-11-08 17:16:08,906 INFO L78 Accepts]: Start accepts. Automaton has 13447 states and 16561 transitions. Word has length 94 [2024-11-08 17:16:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:08,906 INFO L471 AbstractCegarLoop]: Abstraction has 13447 states and 16561 transitions. [2024-11-08 17:16:08,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 17:16:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 13447 states and 16561 transitions. [2024-11-08 17:16:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-08 17:16:08,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:08,910 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:16:08,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 17:16:08,910 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:16:08,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:08,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1988696559, now seen corresponding path program 1 times [2024-11-08 17:16:08,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:08,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479094736] [2024-11-08 17:16:08,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:08,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:08,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:16:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:08,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:16:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:08,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:16:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:08,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:16:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:08,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:16:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:08,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:16:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:08,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-08 17:16:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:08,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:16:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-08 17:16:08,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:08,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479094736] [2024-11-08 17:16:08,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479094736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:08,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:08,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:16:08,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106659204] [2024-11-08 17:16:08,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:08,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:16:08,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:08,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:16:08,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:16:08,951 INFO L87 Difference]: Start difference. First operand 13447 states and 16561 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-08 17:16:10,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:10,349 INFO L93 Difference]: Finished difference Result 16041 states and 19977 transitions. [2024-11-08 17:16:10,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:16:10,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (8), 4 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 94 [2024-11-08 17:16:10,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:10,381 INFO L225 Difference]: With dead ends: 16041 [2024-11-08 17:16:10,381 INFO L226 Difference]: Without dead ends: 13224 [2024-11-08 17:16:10,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:16:10,389 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 376 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:10,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 482 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:16:10,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13224 states. [2024-11-08 17:16:11,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13224 to 12904. [2024-11-08 17:16:11,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12904 states, 10031 states have (on average 1.2113448310238262) internal successors, (12151), 10204 states have internal predecessors, (12151), 1430 states have call successors, (1430), 1161 states have call predecessors, (1430), 1441 states have return successors, (2244), 1549 states have call predecessors, (2244), 1427 states have call successors, (2244) [2024-11-08 17:16:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12904 states to 12904 states and 15825 transitions. [2024-11-08 17:16:11,591 INFO L78 Accepts]: Start accepts. Automaton has 12904 states and 15825 transitions. Word has length 94 [2024-11-08 17:16:11,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:11,592 INFO L471 AbstractCegarLoop]: Abstraction has 12904 states and 15825 transitions. [2024-11-08 17:16:11,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-08 17:16:11,592 INFO L276 IsEmpty]: Start isEmpty. Operand 12904 states and 15825 transitions. [2024-11-08 17:16:11,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-08 17:16:11,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:11,596 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 17:16:11,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 17:16:11,596 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:16:11,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:11,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1903287286, now seen corresponding path program 1 times [2024-11-08 17:16:11,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:11,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453094752] [2024-11-08 17:16:11,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:11,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:11,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:16:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:11,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:16:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:11,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:16:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:11,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:16:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:11,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:16:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:11,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:16:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:11,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-08 17:16:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:11,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 17:16:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:11,654 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 17:16:11,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:11,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453094752] [2024-11-08 17:16:11,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453094752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:11,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:11,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:16:11,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194563246] [2024-11-08 17:16:11,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:11,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:16:11,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:11,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:16:11,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:16:11,655 INFO L87 Difference]: Start difference. First operand 12904 states and 15825 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 17:16:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:13,663 INFO L93 Difference]: Finished difference Result 17669 states and 22227 transitions. [2024-11-08 17:16:13,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-08 17:16:13,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 96 [2024-11-08 17:16:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:13,705 INFO L225 Difference]: With dead ends: 17669 [2024-11-08 17:16:13,705 INFO L226 Difference]: Without dead ends: 14371 [2024-11-08 17:16:13,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2024-11-08 17:16:13,721 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 1360 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1374 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:13,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1374 Valid, 820 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:16:13,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14371 states. [2024-11-08 17:16:15,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14371 to 14055. [2024-11-08 17:16:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14055 states, 10993 states have (on average 1.209042117711271) internal successors, (13291), 11188 states have internal predecessors, (13291), 1519 states have call successors, (1519), 1233 states have call predecessors, (1519), 1541 states have return successors, (2380), 1644 states have call predecessors, (2380), 1516 states have call successors, (2380) [2024-11-08 17:16:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14055 states to 14055 states and 17190 transitions. [2024-11-08 17:16:15,155 INFO L78 Accepts]: Start accepts. Automaton has 14055 states and 17190 transitions. Word has length 96 [2024-11-08 17:16:15,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:15,155 INFO L471 AbstractCegarLoop]: Abstraction has 14055 states and 17190 transitions. [2024-11-08 17:16:15,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 5 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-08 17:16:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 14055 states and 17190 transitions. [2024-11-08 17:16:15,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 17:16:15,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:15,164 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:16:15,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-08 17:16:15,165 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:16:15,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:15,165 INFO L85 PathProgramCache]: Analyzing trace with hash 2064034934, now seen corresponding path program 1 times [2024-11-08 17:16:15,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:15,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458560209] [2024-11-08 17:16:15,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:15,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:15,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:16:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:16:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:15,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:16:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:15,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:16:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:15,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:16:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:15,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:16:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:15,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-08 17:16:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:15,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:16:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:15,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 17:16:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:15,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-08 17:16:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:15,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 17:16:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-08 17:16:15,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:15,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458560209] [2024-11-08 17:16:15,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458560209] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:15,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577637594] [2024-11-08 17:16:15,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:15,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:15,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 17:16:15,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:16:15,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:16:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:15,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 17:16:15,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:16:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-08 17:16:15,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:16:15,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577637594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:15,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:16:15,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-08 17:16:15,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485201244] [2024-11-08 17:16:15,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:15,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:16:15,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:15,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:16:15,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:16:15,380 INFO L87 Difference]: Start difference. First operand 14055 states and 17190 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-08 17:16:16,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:16,639 INFO L93 Difference]: Finished difference Result 17329 states and 21482 transitions. [2024-11-08 17:16:16,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:16:16,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 139 [2024-11-08 17:16:16,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:16,676 INFO L225 Difference]: With dead ends: 17329 [2024-11-08 17:16:16,677 INFO L226 Difference]: Without dead ends: 13964 [2024-11-08 17:16:16,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:16:16,687 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 243 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:16,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 308 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:16:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13964 states. [2024-11-08 17:16:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13964 to 13824. [2024-11-08 17:16:18,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13824 states, 10828 states have (on average 1.198559290727743) internal successors, (12978), 11008 states have internal predecessors, (12978), 1483 states have call successors, (1483), 1221 states have call predecessors, (1483), 1511 states have return successors, (2272), 1604 states have call predecessors, (2272), 1480 states have call successors, (2272) [2024-11-08 17:16:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13824 states to 13824 states and 16733 transitions. [2024-11-08 17:16:18,082 INFO L78 Accepts]: Start accepts. Automaton has 13824 states and 16733 transitions. Word has length 139 [2024-11-08 17:16:18,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:18,083 INFO L471 AbstractCegarLoop]: Abstraction has 13824 states and 16733 transitions. [2024-11-08 17:16:18,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-08 17:16:18,083 INFO L276 IsEmpty]: Start isEmpty. Operand 13824 states and 16733 transitions. [2024-11-08 17:16:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-08 17:16:18,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:18,092 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:16:18,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 17:16:18,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-08 17:16:18,292 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:16:18,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:18,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2068930323, now seen corresponding path program 1 times [2024-11-08 17:16:18,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:18,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120549509] [2024-11-08 17:16:18,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:18,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:18,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:16:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:18,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:16:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:18,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:16:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:18,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:16:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:18,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:16:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:18,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:16:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:18,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-08 17:16:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:18,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 17:16:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:18,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 17:16:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:18,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-08 17:16:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:18,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 17:16:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-08 17:16:18,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:18,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120549509] [2024-11-08 17:16:18,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120549509] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:18,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228607459] [2024-11-08 17:16:18,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:18,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:18,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 17:16:18,373 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:16:18,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:16:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:18,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 17:16:18,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:16:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-08 17:16:18,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:16:18,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228607459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:18,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:16:18,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-08 17:16:18,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147762158] [2024-11-08 17:16:18,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:18,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:16:18,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:18,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:16:18,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:16:18,477 INFO L87 Difference]: Start difference. First operand 13824 states and 16733 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-08 17:16:19,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:19,767 INFO L93 Difference]: Finished difference Result 15983 states and 19377 transitions. [2024-11-08 17:16:19,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:16:19,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 139 [2024-11-08 17:16:19,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:19,804 INFO L225 Difference]: With dead ends: 15983 [2024-11-08 17:16:19,804 INFO L226 Difference]: Without dead ends: 13609 [2024-11-08 17:16:19,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:16:19,810 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 117 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:19,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 646 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:16:19,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13609 states. [2024-11-08 17:16:21,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13609 to 13605. [2024-11-08 17:16:21,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13605 states, 10671 states have (on average 1.1974510355168213) internal successors, (12778), 10853 states have internal predecessors, (12778), 1441 states have call successors, (1441), 1199 states have call predecessors, (1441), 1491 states have return successors, (2217), 1562 states have call predecessors, (2217), 1438 states have call successors, (2217) [2024-11-08 17:16:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13605 states to 13605 states and 16436 transitions. [2024-11-08 17:16:21,290 INFO L78 Accepts]: Start accepts. Automaton has 13605 states and 16436 transitions. Word has length 139 [2024-11-08 17:16:21,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:21,290 INFO L471 AbstractCegarLoop]: Abstraction has 13605 states and 16436 transitions. [2024-11-08 17:16:21,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-08 17:16:21,291 INFO L276 IsEmpty]: Start isEmpty. Operand 13605 states and 16436 transitions. [2024-11-08 17:16:21,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-08 17:16:21,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:21,299 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:16:21,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 17:16:21,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:21,503 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:16:21,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:21,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2143604818, now seen corresponding path program 1 times [2024-11-08 17:16:21,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:21,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916795657] [2024-11-08 17:16:21,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:21,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:21,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:16:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:21,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:16:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:21,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:16:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:21,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:16:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:21,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:16:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:21,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:16:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:21,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 17:16:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:21,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-08 17:16:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:21,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:16:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:21,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-08 17:16:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:21,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:16:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 38 proven. 7 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-08 17:16:21,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:21,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916795657] [2024-11-08 17:16:21,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916795657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:21,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893506151] [2024-11-08 17:16:21,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:21,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:21,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 17:16:21,577 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:16:21,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 17:16:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:21,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:16:21,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:16:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 17:16:21,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:16:21,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893506151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:21,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:16:21,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2024-11-08 17:16:21,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117170771] [2024-11-08 17:16:21,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:21,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:16:21,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:21,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:16:21,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:16:21,709 INFO L87 Difference]: Start difference. First operand 13605 states and 16436 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-08 17:16:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:22,958 INFO L93 Difference]: Finished difference Result 15760 states and 19133 transitions. [2024-11-08 17:16:22,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:16:22,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 140 [2024-11-08 17:16:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:22,989 INFO L225 Difference]: With dead ends: 15760 [2024-11-08 17:16:22,989 INFO L226 Difference]: Without dead ends: 13617 [2024-11-08 17:16:22,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:16:22,996 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 88 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:22,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 633 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:16:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13617 states. [2024-11-08 17:16:24,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13617 to 13601. [2024-11-08 17:16:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13601 states, 10667 states have (on average 1.1919002531170901) internal successors, (12714), 10849 states have internal predecessors, (12714), 1441 states have call successors, (1441), 1199 states have call predecessors, (1441), 1491 states have return successors, (2217), 1562 states have call predecessors, (2217), 1438 states have call successors, (2217) [2024-11-08 17:16:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13601 states to 13601 states and 16372 transitions. [2024-11-08 17:16:24,329 INFO L78 Accepts]: Start accepts. Automaton has 13601 states and 16372 transitions. Word has length 140 [2024-11-08 17:16:24,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:24,330 INFO L471 AbstractCegarLoop]: Abstraction has 13601 states and 16372 transitions. [2024-11-08 17:16:24,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-08 17:16:24,330 INFO L276 IsEmpty]: Start isEmpty. Operand 13601 states and 16372 transitions. [2024-11-08 17:16:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 17:16:24,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:24,338 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:16:24,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 17:16:24,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-08 17:16:24,538 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:16:24,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:24,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2089728469, now seen corresponding path program 1 times [2024-11-08 17:16:24,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:24,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602306770] [2024-11-08 17:16:24,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:24,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:16:24,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 17:16:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:16:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 17:16:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:16:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:16:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:16:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 17:16:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 17:16:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 17:16:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:16:24,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 17:16:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:16:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 17:16:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 17:16:24,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:16:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,646 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-08 17:16:24,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:24,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602306770] [2024-11-08 17:16:24,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602306770] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:16:24,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158097062] [2024-11-08 17:16:24,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:24,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:24,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 17:16:24,648 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:16:24,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 17:16:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:24,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:16:24,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:16:24,768 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 17:16:24,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:16:24,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158097062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:24,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:16:24,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-11-08 17:16:24,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390553842] [2024-11-08 17:16:24,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:24,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:16:24,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:24,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:16:24,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:16:24,770 INFO L87 Difference]: Start difference. First operand 13601 states and 16372 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 17:16:25,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:25,413 INFO L93 Difference]: Finished difference Result 18461 states and 22189 transitions. [2024-11-08 17:16:25,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:16:25,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2024-11-08 17:16:25,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:25,437 INFO L225 Difference]: With dead ends: 18461 [2024-11-08 17:16:25,437 INFO L226 Difference]: Without dead ends: 7879 [2024-11-08 17:16:25,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:16:25,452 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 0 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:25,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1386 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:16:25,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7879 states. [2024-11-08 17:16:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7879 to 7725. [2024-11-08 17:16:26,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7725 states, 6232 states have (on average 1.1842105263157894) internal successors, (7380), 6312 states have internal predecessors, (7380), 743 states have call successors, (743), 593 states have call predecessors, (743), 748 states have return successors, (1057), 820 states have call predecessors, (1057), 740 states have call successors, (1057) [2024-11-08 17:16:26,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7725 states to 7725 states and 9180 transitions. [2024-11-08 17:16:26,108 INFO L78 Accepts]: Start accepts. Automaton has 7725 states and 9180 transitions. Word has length 145 [2024-11-08 17:16:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:26,108 INFO L471 AbstractCegarLoop]: Abstraction has 7725 states and 9180 transitions. [2024-11-08 17:16:26,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 17:16:26,108 INFO L276 IsEmpty]: Start isEmpty. Operand 7725 states and 9180 transitions. [2024-11-08 17:16:26,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 17:16:26,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:26,114 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:16:26,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 17:16:26,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:16:26,315 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:16:26,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:26,315 INFO L85 PathProgramCache]: Analyzing trace with hash 685959430, now seen corresponding path program 1 times [2024-11-08 17:16:26,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:26,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961884832] [2024-11-08 17:16:26,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:26,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:26,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:16:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:26,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:16:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:26,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:16:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:26,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:16:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:16:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:26,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:16:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:26,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 17:16:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:26,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-08 17:16:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:26,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:16:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:26,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-08 17:16:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:26,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 17:16:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-08 17:16:26,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:26,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961884832] [2024-11-08 17:16:26,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961884832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:26,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:26,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:16:26,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25229276] [2024-11-08 17:16:26,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:26,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:16:26,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:26,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:16:26,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:16:26,410 INFO L87 Difference]: Start difference. First operand 7725 states and 9180 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-08 17:16:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:27,523 INFO L93 Difference]: Finished difference Result 11241 states and 13316 transitions. [2024-11-08 17:16:27,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:16:27,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 141 [2024-11-08 17:16:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:27,546 INFO L225 Difference]: With dead ends: 11241 [2024-11-08 17:16:27,546 INFO L226 Difference]: Without dead ends: 8686 [2024-11-08 17:16:27,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:16:27,550 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 673 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:27,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 701 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 17:16:27,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8686 states. [2024-11-08 17:16:28,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8686 to 8142. [2024-11-08 17:16:28,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8142 states, 6570 states have (on average 1.1796042617960427) internal successors, (7750), 6655 states have internal predecessors, (7750), 787 states have call successors, (787), 623 states have call predecessors, (787), 783 states have return successors, (1107), 864 states have call predecessors, (1107), 784 states have call successors, (1107) [2024-11-08 17:16:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8142 states to 8142 states and 9644 transitions. [2024-11-08 17:16:28,246 INFO L78 Accepts]: Start accepts. Automaton has 8142 states and 9644 transitions. Word has length 141 [2024-11-08 17:16:28,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:28,247 INFO L471 AbstractCegarLoop]: Abstraction has 8142 states and 9644 transitions. [2024-11-08 17:16:28,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-08 17:16:28,247 INFO L276 IsEmpty]: Start isEmpty. Operand 8142 states and 9644 transitions. [2024-11-08 17:16:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-08 17:16:28,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:28,253 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:16:28,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-08 17:16:28,253 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:16:28,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:28,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1787043393, now seen corresponding path program 1 times [2024-11-08 17:16:28,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:28,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028554240] [2024-11-08 17:16:28,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:28,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:28,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:16:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:28,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 17:16:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:28,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:16:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:28,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 17:16:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:28,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:16:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:28,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 17:16:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:28,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:16:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:28,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 17:16:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:28,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 17:16:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:28,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 17:16:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:28,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 17:16:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:28,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 17:16:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:28,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 17:16:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:28,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 17:16:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:28,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 17:16:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:28,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-08 17:16:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-08 17:16:28,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:28,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028554240] [2024-11-08 17:16:28,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028554240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:28,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:28,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:16:28,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384206877] [2024-11-08 17:16:28,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:28,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:16:28,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:28,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:16:28,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:16:28,315 INFO L87 Difference]: Start difference. First operand 8142 states and 9644 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 17:16:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:29,203 INFO L93 Difference]: Finished difference Result 8690 states and 10262 transitions. [2024-11-08 17:16:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:16:29,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2024-11-08 17:16:29,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:29,222 INFO L225 Difference]: With dead ends: 8690 [2024-11-08 17:16:29,223 INFO L226 Difference]: Without dead ends: 7941 [2024-11-08 17:16:29,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:16:29,225 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 407 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:29,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 503 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:16:29,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7941 states. [2024-11-08 17:16:29,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7941 to 7717. [2024-11-08 17:16:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7717 states, 6241 states have (on average 1.18090049671527) internal successors, (7370), 6323 states have internal predecessors, (7370), 741 states have call successors, (741), 583 states have call predecessors, (741), 733 states have return successors, (1043), 811 states have call predecessors, (1043), 738 states have call successors, (1043) [2024-11-08 17:16:29,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7717 states to 7717 states and 9154 transitions. [2024-11-08 17:16:29,907 INFO L78 Accepts]: Start accepts. Automaton has 7717 states and 9154 transitions. Word has length 147 [2024-11-08 17:16:29,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:29,907 INFO L471 AbstractCegarLoop]: Abstraction has 7717 states and 9154 transitions. [2024-11-08 17:16:29,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 17:16:29,908 INFO L276 IsEmpty]: Start isEmpty. Operand 7717 states and 9154 transitions. [2024-11-08 17:16:29,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-08 17:16:29,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:29,912 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:16:29,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-08 17:16:29,912 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:16:29,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:29,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1859604718, now seen corresponding path program 1 times [2024-11-08 17:16:29,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:29,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520596481] [2024-11-08 17:16:29,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:29,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:29,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 17:16:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:29,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:16:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:29,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 17:16:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:29,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 17:16:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:29,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 17:16:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:29,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 17:16:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:29,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 17:16:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:29,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-08 17:16:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:29,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:16:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:29,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-11-08 17:16:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:29,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 17:16:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:16:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-08 17:16:29,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:16:29,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520596481] [2024-11-08 17:16:29,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520596481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:16:29,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:16:29,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:16:29,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279568531] [2024-11-08 17:16:29,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:16:29,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:16:29,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:16:29,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:16:29,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:16:29,967 INFO L87 Difference]: Start difference. First operand 7717 states and 9154 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 17:16:30,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:16:30,816 INFO L93 Difference]: Finished difference Result 10192 states and 12076 transitions. [2024-11-08 17:16:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:16:30,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 145 [2024-11-08 17:16:30,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:16:30,838 INFO L225 Difference]: With dead ends: 10192 [2024-11-08 17:16:30,839 INFO L226 Difference]: Without dead ends: 8240 [2024-11-08 17:16:30,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:16:30,843 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 212 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:16:30,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 543 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:16:30,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8240 states. [2024-11-08 17:16:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8240 to 7720. [2024-11-08 17:16:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7720 states, 6244 states have (on average 1.1808135810377962) internal successors, (7373), 6326 states have internal predecessors, (7373), 741 states have call successors, (741), 583 states have call predecessors, (741), 733 states have return successors, (1043), 811 states have call predecessors, (1043), 738 states have call successors, (1043) [2024-11-08 17:16:31,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7720 states to 7720 states and 9157 transitions. [2024-11-08 17:16:31,560 INFO L78 Accepts]: Start accepts. Automaton has 7720 states and 9157 transitions. Word has length 145 [2024-11-08 17:16:31,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:16:31,560 INFO L471 AbstractCegarLoop]: Abstraction has 7720 states and 9157 transitions. [2024-11-08 17:16:31,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 17:16:31,561 INFO L276 IsEmpty]: Start isEmpty. Operand 7720 states and 9157 transitions. [2024-11-08 17:16:31,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-08 17:16:31,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:16:31,566 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:16:31,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 17:16:31,567 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:16:31,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:16:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1252673260, now seen corresponding path program 1 times [2024-11-08 17:16:31,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:16:31,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47040914] [2024-11-08 17:16:31,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:16:31,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:16:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:16:31,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:16:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:16:31,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:16:31,644 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:16:31,645 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-08 17:16:31,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-08 17:16:31,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 17:16:31,650 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:16:31,749 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:16:31,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:16:31 BoogieIcfgContainer [2024-11-08 17:16:31,752 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:16:31,753 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:16:31,753 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:16:31,753 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:16:31,753 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:15:34" (3/4) ... [2024-11-08 17:16:31,754 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 17:16:31,860 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 17:16:31,862 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:16:31,863 INFO L158 Benchmark]: Toolchain (without parser) took 58774.49ms. Allocated memory was 178.3MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 122.5MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-08 17:16:31,863 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 178.3MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:16:31,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.78ms. Allocated memory is still 178.3MB. Free memory was 122.5MB in the beginning and 103.2MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 17:16:31,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.14ms. Allocated memory is still 178.3MB. Free memory was 103.2MB in the beginning and 100.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:16:31,863 INFO L158 Benchmark]: Boogie Preprocessor took 40.62ms. Allocated memory is still 178.3MB. Free memory was 100.7MB in the beginning and 97.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:16:31,863 INFO L158 Benchmark]: RCFGBuilder took 563.52ms. Allocated memory is still 178.3MB. Free memory was 97.4MB in the beginning and 65.5MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 17:16:31,863 INFO L158 Benchmark]: TraceAbstraction took 57708.25ms. Allocated memory was 178.3MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 64.7MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 974.7MB. Max. memory is 16.1GB. [2024-11-08 17:16:31,863 INFO L158 Benchmark]: Witness Printer took 109.56ms. Allocated memory is still 4.6GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 17:16:31,864 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 178.3MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.78ms. Allocated memory is still 178.3MB. Free memory was 122.5MB in the beginning and 103.2MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.14ms. Allocated memory is still 178.3MB. Free memory was 103.2MB in the beginning and 100.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.62ms. Allocated memory is still 178.3MB. Free memory was 100.7MB in the beginning and 97.4MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 563.52ms. Allocated memory is still 178.3MB. Free memory was 97.4MB in the beginning and 65.5MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 57708.25ms. Allocated memory was 178.3MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 64.7MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 974.7MB. Max. memory is 16.1GB. * Witness Printer took 109.56ms. Allocated memory is still 4.6GB. Free memory was 3.5GB in the beginning and 3.5GB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 496]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int m_st ; [L503] int t1_st ; [L504] int m_i ; [L505] int t1_i ; [L506] int M_E = 2; [L507] int T1_E = 2; [L508] int E_M = 2; [L509] int E_1 = 2; [L513] int token ; [L515] int local ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=0, t1_pc=0, t1_st=0, token=0] [L974] COND FALSE !(__VERIFIER_nondet_int()) [L977] CALL main2() [L961] int __retres1 ; [L965] CALL init_model2() [L876] m_i = 1 [L877] t1_i = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L965] RET init_model2() [L966] CALL start_simulation2() [L902] int kernel_st ; [L903] int tmp ; [L904] int tmp___0 ; [L908] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L909] FCALL update_channels2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] CALL init_threads2() [L658] COND TRUE m_i == 1 [L659] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L663] COND TRUE t1_i == 1 [L664] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L910] RET init_threads2() [L911] CALL fire_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L747] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L752] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L757] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L762] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L911] RET fire_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L912] CALL activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L612] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L622] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L624] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L631] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L643] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L912] RET activate_threads2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] CALL reset_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L775] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L780] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L785] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L790] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L913] RET reset_delta_events2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L916] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L919] kernel_st = 1 [L920] CALL eval2() [L694] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L698] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L673] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L689] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L587] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L728] RET transmit1() [L698] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L701] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L673] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L689] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L701] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L531] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L534] token = __VERIFIER_nondet_int() [L535] local = token [L536] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L537] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L829] CALL activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L612] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L624] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L631] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L632] COND TRUE E_1 == 1 [L633] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L643] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND TRUE \read(tmp___0) [L816] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, token=0] [L829] RET activate_threads2() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, token=0] [L537] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L538] E_1 = 2 [L539] m_pc = 1 [L540] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L714] RET master() [L722] COND TRUE t1_st == 0 [L723] int tmp_ndt_2; [L724] tmp_ndt_2 = __VERIFIER_nondet_int() [L725] COND TRUE \read(tmp_ndt_2) [L727] t1_st = 1 [L728] CALL transmit1() [L576] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L579] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=0] [L595] token += 1 [L596] E_M = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] CALL immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L829] CALL activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L800] int tmp ; [L801] int tmp___0 ; [L805] CALL, EXPR is_master_triggered() [L609] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L612] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L613] COND TRUE E_M == 1 [L614] __retres1 = 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L624] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND TRUE \read(tmp) [L808] m_st = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L813] CALL, EXPR is_transmit1_triggered() [L628] int __retres1 ; VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L631] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L632] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L641] __retres1 = 0 VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L643] return (__retres1); VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, \result=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L829] RET activate_threads2() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, \old(m_st)=2, \old(t1_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L597] RET immediate_notify() VAL [E_1=2, E_M=1, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L598] E_M = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L587] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=1, token=1] [L589] t1_pc = 1 [L590] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L728] RET transmit1() [L698] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L701] CALL, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L673] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L689] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L701] RET, EXPR exists_runnable_thread2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L701] tmp = exists_runnable_thread2() [L703] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L708] COND TRUE m_st == 0 [L709] int tmp_ndt_1; [L710] tmp_ndt_1 = __VERIFIER_nondet_int() [L711] COND TRUE \read(tmp_ndt_1) [L713] m_st = 1 [L714] CALL master() [L518] int tmp_var = __VERIFIER_nondet_int(); [L520] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L523] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L545] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L550] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L551] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L556] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L557] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L558] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L559] CALL error2() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] [L496] reach_error() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, local=0, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 28]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 218 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 57.6s, OverallIterations: 34, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 33.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19223 SdHoareTripleChecker+Valid, 11.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18735 mSDsluCounter, 26977 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19730 mSDsCounter, 4079 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19486 IncrementalHoareTripleChecker+Invalid, 23565 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4079 mSolverCounterUnsat, 7247 mSDtfsCounter, 19486 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1811 GetRequests, 1373 SyntacticMatches, 0 SemanticMatches, 438 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1440 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14497occurred in iteration=22, InterpolantAutomatonStates: 411, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 10982 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 3565 NumberOfCodeBlocks, 3565 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3454 ConstructedInterpolants, 0 QuantifiedInterpolants, 6868 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2034 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 39 InterpolantComputations, 32 PerfectInterpolantSequences, 1007/1032 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-08 17:16:31,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE