./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 a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7581eca761af2e68d92eb1cb64032fd3321be3eb54b53aabe807351a9f77b1d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:49:32,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:49:32,602 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 06:49:32,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:49:32,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:49:32,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:49:32,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:49:32,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:49:32,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:49:32,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:49:32,651 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:49:32,651 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:49:32,651 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:49:32,652 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:49:32,652 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:49:32,653 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:49:32,653 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:49:32,653 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:49:32,657 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:49:32,657 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:49:32,660 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:49:32,661 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:49:32,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:49:32,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:49:32,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:49:32,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:49:32,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:49:32,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:49:32,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:49:32,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:49:32,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:49:32,666 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:49:32,667 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:49:32,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:49:32,667 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:49:32,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:49:32,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:49:32,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:49:32,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:49:32,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:49:32,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:49:32,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:49:32,671 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:49:32,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:49:32,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:49:32,672 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:49:32,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:49:32,673 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje 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 -> Taipan 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-09 06:49:33,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:49:33,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:49:33,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:49:33,063 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:49:33,065 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:49:33,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c Unable to find full path for "g++" [2024-11-09 06:49:35,054 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:49:35,346 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:49:35,346 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2024-11-09 06:49:35,361 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/data/11ac99bce/b516cc60731d4eee8ca47c138fb71caf/FLAGd0508e87a [2024-11-09 06:49:35,634 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/data/11ac99bce/b516cc60731d4eee8ca47c138fb71caf [2024-11-09 06:49:35,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:49:35,638 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:49:35,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:49:35,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:49:35,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:49:35,650 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:49:35" (1/1) ... [2024-11-09 06:49:35,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343fa1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:49:35, skipping insertion in model container [2024-11-09 06:49:35,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:49:35" (1/1) ... [2024-11-09 06:49:35,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:49:35,891 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2024-11-09 06:49:35,976 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2024-11-09 06:49:36,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:49:36,066 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:49:36,080 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[914,927] [2024-11-09 06:49:36,104 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-2.c[7115,7128] [2024-11-09 06:49:36,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:49:36,154 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:49:36,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:49:36 WrapperNode [2024-11-09 06:49:36,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:49:36,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:49:36,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:49:36,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:49:36,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:49:36" (1/1) ... [2024-11-09 06:49:36,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:49:36" (1/1) ... [2024-11-09 06:49:36,225 INFO L138 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 23, calls inlined = 23, statements flattened = 406 [2024-11-09 06:49:36,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:49:36,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:49:36,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:49:36,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:49:36,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:49:36" (1/1) ... [2024-11-09 06:49:36,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:49:36" (1/1) ... [2024-11-09 06:49:36,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:49:36" (1/1) ... [2024-11-09 06:49:36,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:49:36" (1/1) ... [2024-11-09 06:49:36,259 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:49:36" (1/1) ... [2024-11-09 06:49:36,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:49:36" (1/1) ... [2024-11-09 06:49:36,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:49:36" (1/1) ... [2024-11-09 06:49:36,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:49:36" (1/1) ... [2024-11-09 06:49:36,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:49:36,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:49:36,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:49:36,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:49:36,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:49:36" (1/1) ... [2024-11-09 06:49:36,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:49:36,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:49:36,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:49:36,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:49:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:49:36,364 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-09 06:49:36,364 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-09 06:49:36,364 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-09 06:49:36,365 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-09 06:49:36,365 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-09 06:49:36,365 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-09 06:49:36,365 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-09 06:49:36,365 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-09 06:49:36,365 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-09 06:49:36,366 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-09 06:49:36,366 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-09 06:49:36,366 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-09 06:49:36,366 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-09 06:49:36,367 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-09 06:49:36,367 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-09 06:49:36,368 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-09 06:49:36,368 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-09 06:49:36,368 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-09 06:49:36,368 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-09 06:49:36,369 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-09 06:49:36,369 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-09 06:49:36,369 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-09 06:49:36,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:49:36,369 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-09 06:49:36,369 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-09 06:49:36,369 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-09 06:49:36,370 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-09 06:49:36,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:49:36,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:49:36,370 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-09 06:49:36,370 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-09 06:49:36,370 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-09 06:49:36,370 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-09 06:49:36,509 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:49:36,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:49:37,195 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2024-11-09 06:49:37,195 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:49:37,440 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:49:37,442 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-09 06:49:37,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:49:37 BoogieIcfgContainer [2024-11-09 06:49:37,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:49:37,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:49:37,447 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:49:37,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:49:37,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:49:35" (1/3) ... [2024-11-09 06:49:37,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612acd90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:49:37, skipping insertion in model container [2024-11-09 06:49:37,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:49:36" (2/3) ... [2024-11-09 06:49:37,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@612acd90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:49:37, skipping insertion in model container [2024-11-09 06:49:37,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:49:37" (3/3) ... [2024-11-09 06:49:37,455 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-2.c [2024-11-09 06:49:37,478 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:49:37,479 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 06:49:37,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:49:37,557 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=FINITE_AUTOMATA, 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;@78ee22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:49:37,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 06:49:37,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 147 states, 98 states have (on average 1.4795918367346939) internal successors, (145), 106 states have internal predecessors, (145), 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-09 06:49:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 06:49:37,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:49:37,607 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] [2024-11-09 06:49:37,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:49:37,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:49:37,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1825574004, now seen corresponding path program 1 times [2024-11-09 06:49:37,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:49:37,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479377466] [2024-11-09 06:49:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:49:37,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:49:37,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:49:38,178 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-09 06:49:38,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:49:38,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479377466] [2024-11-09 06:49:38,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479377466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:49:38,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:49:38,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:49:38,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542305656] [2024-11-09 06:49:38,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:49:38,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:49:38,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:49:38,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:49:38,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:49:38,225 INFO L87 Difference]: Start difference. First operand has 147 states, 98 states have (on average 1.4795918367346939) internal successors, (145), 106 states have internal predecessors, (145), 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 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (6), 2 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-09 06:49:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:49:39,039 INFO L93 Difference]: Finished difference Result 519 states and 750 transitions. [2024-11-09 06:49:39,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:49:39,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (6), 2 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 35 [2024-11-09 06:49:39,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:49:39,056 INFO L225 Difference]: With dead ends: 519 [2024-11-09 06:49:39,056 INFO L226 Difference]: Without dead ends: 367 [2024-11-09 06:49:39,061 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:49:39,065 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 450 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:49:39,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 482 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:49:39,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-09 06:49:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 354. [2024-11-09 06:49:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 243 states have (on average 1.3292181069958848) internal successors, (323), 251 states have internal predecessors, (323), 72 states have call successors, (72), 39 states have call predecessors, (72), 37 states have return successors, (86), 65 states have call predecessors, (86), 68 states have call successors, (86) [2024-11-09 06:49:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 481 transitions. [2024-11-09 06:49:39,215 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 481 transitions. Word has length 35 [2024-11-09 06:49:39,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:49:39,216 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 481 transitions. [2024-11-09 06:49:39,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (6), 2 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-09 06:49:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 481 transitions. [2024-11-09 06:49:39,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 06:49:39,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:49:39,221 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:49:39,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:49:39,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:49:39,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:49:39,223 INFO L85 PathProgramCache]: Analyzing trace with hash -833782254, now seen corresponding path program 1 times [2024-11-09 06:49:39,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:49:39,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674682220] [2024-11-09 06:49:39,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:49:39,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:49:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:49:39,400 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-09 06:49:39,400 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:49:39,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674682220] [2024-11-09 06:49:39,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674682220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:49:39,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:49:39,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:49:39,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030913709] [2024-11-09 06:49:39,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:49:39,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:49:39,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:49:39,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:49:39,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:49:39,407 INFO L87 Difference]: Start difference. First operand 354 states and 481 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 06:49:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:49:39,753 INFO L93 Difference]: Finished difference Result 478 states and 643 transitions. [2024-11-09 06:49:39,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:49:39,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2024-11-09 06:49:39,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:49:39,761 INFO L225 Difference]: With dead ends: 478 [2024-11-09 06:49:39,761 INFO L226 Difference]: Without dead ends: 414 [2024-11-09 06:49:39,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:49:39,767 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 245 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:49:39,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 350 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:49:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-09 06:49:39,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 407. [2024-11-09 06:49:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 281 states have (on average 1.3167259786476868) internal successors, (370), 289 states have internal predecessors, (370), 80 states have call successors, (80), 46 states have call predecessors, (80), 44 states have return successors, (94), 73 states have call predecessors, (94), 76 states have call successors, (94) [2024-11-09 06:49:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 544 transitions. [2024-11-09 06:49:39,854 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 544 transitions. Word has length 45 [2024-11-09 06:49:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:49:39,855 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 544 transitions. [2024-11-09 06:49:39,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-09 06:49:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 544 transitions. [2024-11-09 06:49:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 06:49:39,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:49:39,860 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] [2024-11-09 06:49:39,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:49:39,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:49:39,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:49:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash 85192369, now seen corresponding path program 1 times [2024-11-09 06:49:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:49:39,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530636883] [2024-11-09 06:49:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:49:39,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:49:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:49:40,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-09 06:49:40,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:49:40,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530636883] [2024-11-09 06:49:40,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530636883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:49:40,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:49:40,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:49:40,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649502997] [2024-11-09 06:49:40,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:49:40,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:49:40,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:49:40,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:49:40,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:49:40,034 INFO L87 Difference]: Start difference. First operand 407 states and 544 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 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-09 06:49:40,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:49:40,827 INFO L93 Difference]: Finished difference Result 809 states and 1047 transitions. [2024-11-09 06:49:40,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:49:40,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 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 45 [2024-11-09 06:49:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:49:40,837 INFO L225 Difference]: With dead ends: 809 [2024-11-09 06:49:40,837 INFO L226 Difference]: Without dead ends: 677 [2024-11-09 06:49:40,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 06:49:40,845 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 572 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:49:40,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 669 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 06:49:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2024-11-09 06:49:40,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 593. [2024-11-09 06:49:40,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 413 states have (on average 1.2832929782082325) internal successors, (530), 422 states have internal predecessors, (530), 107 states have call successors, (107), 69 states have call predecessors, (107), 71 states have return successors, (125), 103 states have call predecessors, (125), 103 states have call successors, (125) [2024-11-09 06:49:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 762 transitions. [2024-11-09 06:49:40,982 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 762 transitions. Word has length 45 [2024-11-09 06:49:40,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:49:40,983 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 762 transitions. [2024-11-09 06:49:40,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 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-09 06:49:40,983 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 762 transitions. [2024-11-09 06:49:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 06:49:40,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:49:40,990 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] [2024-11-09 06:49:40,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:49:40,991 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:49:40,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:49:40,992 INFO L85 PathProgramCache]: Analyzing trace with hash 845469014, now seen corresponding path program 1 times [2024-11-09 06:49:40,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:49:40,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349662485] [2024-11-09 06:49:40,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:49:40,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:49:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:49:41,323 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-09 06:49:41,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:49:41,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349662485] [2024-11-09 06:49:41,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349662485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:49:41,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:49:41,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 06:49:41,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985651236] [2024-11-09 06:49:41,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:49:41,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:49:41,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:49:41,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:49:41,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:49:41,329 INFO L87 Difference]: Start difference. First operand 593 states and 762 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 06:49:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:49:42,065 INFO L93 Difference]: Finished difference Result 1109 states and 1378 transitions. [2024-11-09 06:49:42,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:49:42,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2024-11-09 06:49:42,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:49:42,073 INFO L225 Difference]: With dead ends: 1109 [2024-11-09 06:49:42,075 INFO L226 Difference]: Without dead ends: 807 [2024-11-09 06:49:42,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2024-11-09 06:49:42,081 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 290 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:49:42,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 506 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 06:49:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2024-11-09 06:49:42,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 772. [2024-11-09 06:49:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 538 states have (on average 1.2676579925650557) internal successors, (682), 548 states have internal predecessors, (682), 134 states have call successors, (134), 92 states have call predecessors, (134), 98 states have return successors, (156), 133 states have call predecessors, (156), 130 states have call successors, (156) [2024-11-09 06:49:42,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 972 transitions. [2024-11-09 06:49:42,186 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 972 transitions. Word has length 46 [2024-11-09 06:49:42,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:49:42,189 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 972 transitions. [2024-11-09 06:49:42,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 06:49:42,189 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 972 transitions. [2024-11-09 06:49:42,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 06:49:42,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:49:42,193 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] [2024-11-09 06:49:42,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:49:42,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:49:42,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:49:42,194 INFO L85 PathProgramCache]: Analyzing trace with hash 213601363, now seen corresponding path program 1 times [2024-11-09 06:49:42,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:49:42,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336851660] [2024-11-09 06:49:42,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:49:42,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:49:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:49:42,257 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-09 06:49:42,257 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:49:42,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336851660] [2024-11-09 06:49:42,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336851660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:49:42,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:49:42,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:49:42,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297256149] [2024-11-09 06:49:42,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:49:42,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:49:42,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:49:42,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:49:42,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:49:42,262 INFO L87 Difference]: Start difference. First operand 772 states and 972 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (8), 2 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-09 06:49:42,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:49:42,441 INFO L93 Difference]: Finished difference Result 1336 states and 1642 transitions. [2024-11-09 06:49:42,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:49:42,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (8), 2 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 47 [2024-11-09 06:49:42,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:49:42,448 INFO L225 Difference]: With dead ends: 1336 [2024-11-09 06:49:42,449 INFO L226 Difference]: Without dead ends: 904 [2024-11-09 06:49:42,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:49:42,451 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 67 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:49:42,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 301 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:49:42,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2024-11-09 06:49:42,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 799. [2024-11-09 06:49:42,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 561 states have (on average 1.2602495543672014) internal successors, (707), 571 states have internal predecessors, (707), 136 states have call successors, (136), 94 states have call predecessors, (136), 100 states have return successors, (158), 135 states have call predecessors, (158), 132 states have call successors, (158) [2024-11-09 06:49:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1001 transitions. [2024-11-09 06:49:42,572 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1001 transitions. Word has length 47 [2024-11-09 06:49:42,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:49:42,573 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1001 transitions. [2024-11-09 06:49:42,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (8), 2 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-09 06:49:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1001 transitions. [2024-11-09 06:49:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 06:49:42,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:49:42,575 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] [2024-11-09 06:49:42,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:49:42,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:49:42,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:49:42,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1927919925, now seen corresponding path program 1 times [2024-11-09 06:49:42,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:49:42,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049884154] [2024-11-09 06:49:42,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:49:42,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:49:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:49:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:49:42,626 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:49:42,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049884154] [2024-11-09 06:49:42,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049884154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:49:42,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:49:42,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:49:42,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477477881] [2024-11-09 06:49:42,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:49:42,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:49:42,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:49:42,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:49:42,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:49:42,629 INFO L87 Difference]: Start difference. First operand 799 states and 1001 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (8), 2 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-09 06:49:42,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:49:42,794 INFO L93 Difference]: Finished difference Result 989 states and 1222 transitions. [2024-11-09 06:49:42,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:49:42,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (8), 2 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 53 [2024-11-09 06:49:42,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:49:42,800 INFO L225 Difference]: With dead ends: 989 [2024-11-09 06:49:42,800 INFO L226 Difference]: Without dead ends: 716 [2024-11-09 06:49:42,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:49:42,802 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 158 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:49:42,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 229 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:49:42,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2024-11-09 06:49:42,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 607. [2024-11-09 06:49:42,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 421 states have (on average 1.2470308788598574) internal successors, (525), 429 states have internal predecessors, (525), 112 states have call successors, (112), 74 states have call predecessors, (112), 72 states have return successors, (126), 105 states have call predecessors, (126), 108 states have call successors, (126) [2024-11-09 06:49:42,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 763 transitions. [2024-11-09 06:49:42,886 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 763 transitions. Word has length 53 [2024-11-09 06:49:42,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:49:42,887 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 763 transitions. [2024-11-09 06:49:42,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (8), 2 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-09 06:49:42,887 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 763 transitions. [2024-11-09 06:49:42,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 06:49:42,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:49:42,889 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] [2024-11-09 06:49:42,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:49:42,889 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:49:42,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:49:42,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1496663923, now seen corresponding path program 1 times [2024-11-09 06:49:42,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:49:42,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937509079] [2024-11-09 06:49:42,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:49:42,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:49:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:49:42,984 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-09 06:49:42,985 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:49:42,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937509079] [2024-11-09 06:49:42,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937509079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:49:42,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:49:42,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:49:42,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248241465] [2024-11-09 06:49:42,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:49:42,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:49:42,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:49:42,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:49:42,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:49:42,988 INFO L87 Difference]: Start difference. First operand 607 states and 763 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 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-09 06:49:43,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:49:43,315 INFO L93 Difference]: Finished difference Result 710 states and 879 transitions. [2024-11-09 06:49:43,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:49:43,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 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 54 [2024-11-09 06:49:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:49:43,320 INFO L225 Difference]: With dead ends: 710 [2024-11-09 06:49:43,320 INFO L226 Difference]: Without dead ends: 707 [2024-11-09 06:49:43,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:49:43,322 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 293 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:49:43,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 200 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:49:43,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2024-11-09 06:49:43,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 606. [2024-11-09 06:49:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 421 states have (on average 1.2399049881235154) internal successors, (522), 428 states have internal predecessors, (522), 111 states have call successors, (111), 74 states have call predecessors, (111), 72 states have return successors, (126), 105 states have call predecessors, (126), 108 states have call successors, (126) [2024-11-09 06:49:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 759 transitions. [2024-11-09 06:49:43,412 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 759 transitions. Word has length 54 [2024-11-09 06:49:43,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:49:43,414 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 759 transitions. [2024-11-09 06:49:43,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 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-09 06:49:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 759 transitions. [2024-11-09 06:49:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 06:49:43,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:49:43,419 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] [2024-11-09 06:49:43,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:49:43,419 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:49:43,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:49:43,420 INFO L85 PathProgramCache]: Analyzing trace with hash -848711141, now seen corresponding path program 1 times [2024-11-09 06:49:43,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:49:43,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446319018] [2024-11-09 06:49:43,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:49:43,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:49:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:49:43,599 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-09 06:49:43,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:49:43,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446319018] [2024-11-09 06:49:43,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446319018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:49:43,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39841214] [2024-11-09 06:49:43,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:49:43,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:49:43,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:49:43,603 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:49:43,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:49:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:49:43,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 06:49:43,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:49:44,032 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-09 06:49:44,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:49:44,147 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-09 06:49:44,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39841214] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:49:44,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2134644069] [2024-11-09 06:49:44,175 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2024-11-09 06:49:44,175 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 06:49:44,179 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 06:49:44,185 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 06:49:44,186 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 06:49:46,766 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 101 for LOIs [2024-11-09 06:49:46,821 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 97 for LOIs [2024-11-09 06:49:46,871 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 105 for LOIs [2024-11-09 06:49:47,407 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 101 for LOIs [2024-11-09 06:49:47,512 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 101 for LOIs [2024-11-09 06:49:47,593 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 101 for LOIs [2024-11-09 06:49:47,619 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 108 for LOIs [2024-11-09 06:49:47,663 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 06:49:54,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [2134644069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:49:54,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:49:54,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [5, 5, 4] total 36 [2024-11-09 06:49:54,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830061318] [2024-11-09 06:49:54,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:49:54,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-09 06:49:54,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:49:54,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-09 06:49:54,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 06:49:54,640 INFO L87 Difference]: Start difference. First operand 606 states and 759 transitions. Second operand has 31 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 7 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 06:50:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:50:02,010 INFO L93 Difference]: Finished difference Result 948 states and 1152 transitions. [2024-11-09 06:50:02,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 06:50:02,010 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 7 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 55 [2024-11-09 06:50:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:50:02,015 INFO L225 Difference]: With dead ends: 948 [2024-11-09 06:50:02,015 INFO L226 Difference]: Without dead ends: 633 [2024-11-09 06:50:02,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 131 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=405, Invalid=1947, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 06:50:02,017 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 90 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 2173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:50:02,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1401 Invalid, 2173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2097 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 06:50:02,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2024-11-09 06:50:02,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 625. [2024-11-09 06:50:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 438 states have (on average 1.2374429223744292) internal successors, (542), 445 states have internal predecessors, (542), 112 states have call successors, (112), 75 states have call predecessors, (112), 73 states have return successors, (127), 106 states have call predecessors, (127), 109 states have call successors, (127) [2024-11-09 06:50:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 781 transitions. [2024-11-09 06:50:02,132 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 781 transitions. Word has length 55 [2024-11-09 06:50:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:50:02,133 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 781 transitions. [2024-11-09 06:50:02,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 24 states have (on average 1.625) internal successors, (39), 24 states have internal predecessors, (39), 7 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-09 06:50:02,133 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 781 transitions. [2024-11-09 06:50:02,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 06:50:02,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:50:02,136 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 06:50:02,158 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 06:50:02,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:50:02,341 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:50:02,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:02,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1015838088, now seen corresponding path program 1 times [2024-11-09 06:50:02,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:50:02,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667307931] [2024-11-09 06:50:02,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:02,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:02,585 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:50:02,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:50:02,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667307931] [2024-11-09 06:50:02,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667307931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:02,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:02,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 06:50:02,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022070598] [2024-11-09 06:50:02,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:02,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:50:02,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:50:02,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:50:02,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:50:02,588 INFO L87 Difference]: Start difference. First operand 625 states and 781 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 06:50:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:50:03,115 INFO L93 Difference]: Finished difference Result 1070 states and 1395 transitions. [2024-11-09 06:50:03,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:50:03,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 61 [2024-11-09 06:50:03,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:50:03,121 INFO L225 Difference]: With dead ends: 1070 [2024-11-09 06:50:03,121 INFO L226 Difference]: Without dead ends: 791 [2024-11-09 06:50:03,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-09 06:50:03,123 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 271 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:50:03,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 425 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:50:03,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2024-11-09 06:50:03,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 777. [2024-11-09 06:50:03,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 542 states have (on average 1.2380073800738007) internal successors, (671), 551 states have internal predecessors, (671), 142 states have call successors, (142), 93 states have call predecessors, (142), 91 states have return successors, (169), 134 states have call predecessors, (169), 139 states have call successors, (169) [2024-11-09 06:50:03,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 982 transitions. [2024-11-09 06:50:03,262 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 982 transitions. Word has length 61 [2024-11-09 06:50:03,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:50:03,263 INFO L471 AbstractCegarLoop]: Abstraction has 777 states and 982 transitions. [2024-11-09 06:50:03,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-09 06:50:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 982 transitions. [2024-11-09 06:50:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 06:50:03,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:50:03,265 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 06:50:03,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:50:03,265 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:50:03,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:03,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1772206300, now seen corresponding path program 1 times [2024-11-09 06:50:03,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:50:03,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920496217] [2024-11-09 06:50:03,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:03,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 06:50:03,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:50:03,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920496217] [2024-11-09 06:50:03,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920496217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:03,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:03,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:50:03,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532850073] [2024-11-09 06:50:03,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:03,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:03,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:50:03,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:03,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:03,333 INFO L87 Difference]: Start difference. First operand 777 states and 982 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:50:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:50:03,555 INFO L93 Difference]: Finished difference Result 1058 states and 1304 transitions. [2024-11-09 06:50:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:03,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2024-11-09 06:50:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:50:03,560 INFO L225 Difference]: With dead ends: 1058 [2024-11-09 06:50:03,561 INFO L226 Difference]: Without dead ends: 889 [2024-11-09 06:50:03,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:03,562 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 42 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:50:03,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 338 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:50:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-09 06:50:03,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 812. [2024-11-09 06:50:03,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 571 states have (on average 1.2381786339754817) internal successors, (707), 580 states have internal predecessors, (707), 145 states have call successors, (145), 96 states have call predecessors, (145), 94 states have return successors, (172), 137 states have call predecessors, (172), 142 states have call successors, (172) [2024-11-09 06:50:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1024 transitions. [2024-11-09 06:50:03,703 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1024 transitions. Word has length 61 [2024-11-09 06:50:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:50:03,704 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1024 transitions. [2024-11-09 06:50:03,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:50:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1024 transitions. [2024-11-09 06:50:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 06:50:03,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:50:03,706 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-09 06:50:03,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:50:03,706 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:50:03,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:03,707 INFO L85 PathProgramCache]: Analyzing trace with hash -144696820, now seen corresponding path program 1 times [2024-11-09 06:50:03,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:50:03,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407587920] [2024-11-09 06:50:03,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:03,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 06:50:03,781 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:50:03,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407587920] [2024-11-09 06:50:03,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407587920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:03,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:03,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:50:03,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550770949] [2024-11-09 06:50:03,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:03,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:03,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:50:03,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:03,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:03,784 INFO L87 Difference]: Start difference. First operand 812 states and 1024 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:50:03,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:50:03,983 INFO L93 Difference]: Finished difference Result 1283 states and 1669 transitions. [2024-11-09 06:50:03,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:03,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2024-11-09 06:50:03,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:50:03,990 INFO L225 Difference]: With dead ends: 1283 [2024-11-09 06:50:03,991 INFO L226 Difference]: Without dead ends: 905 [2024-11-09 06:50:03,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:50:03,994 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 28 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:50:03,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 339 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:50:03,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-09 06:50:04,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 849. [2024-11-09 06:50:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 602 states have (on average 1.2425249169435215) internal successors, (748), 611 states have internal predecessors, (748), 148 states have call successors, (148), 99 states have call predecessors, (148), 97 states have return successors, (175), 140 states have call predecessors, (175), 145 states have call successors, (175) [2024-11-09 06:50:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1071 transitions. [2024-11-09 06:50:04,140 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1071 transitions. Word has length 63 [2024-11-09 06:50:04,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:50:04,141 INFO L471 AbstractCegarLoop]: Abstraction has 849 states and 1071 transitions. [2024-11-09 06:50:04,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 06:50:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1071 transitions. [2024-11-09 06:50:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 06:50:04,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:50:04,144 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 06:50:04,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:50:04,144 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:50:04,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:04,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1284076767, now seen corresponding path program 1 times [2024-11-09 06:50:04,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:50:04,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571760183] [2024-11-09 06:50:04,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:04,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 06:50:04,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:50:04,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571760183] [2024-11-09 06:50:04,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571760183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:50:04,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824649262] [2024-11-09 06:50:04,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:04,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:50:04,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:50:04,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:50:04,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:50:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:04,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 06:50:04,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:50:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 06:50:04,417 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:50:04,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824649262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:04,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:50:04,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 06:50:04,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107986733] [2024-11-09 06:50:04,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:04,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:04,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:50:04,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:04,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:50:04,420 INFO L87 Difference]: Start difference. First operand 849 states and 1071 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-09 06:50:04,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:50:04,614 INFO L93 Difference]: Finished difference Result 1274 states and 1651 transitions. [2024-11-09 06:50:04,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:04,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 91 [2024-11-09 06:50:04,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:50:04,621 INFO L225 Difference]: With dead ends: 1274 [2024-11-09 06:50:04,621 INFO L226 Difference]: Without dead ends: 928 [2024-11-09 06:50:04,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 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-09 06:50:04,624 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 153 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:50:04,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 174 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:50:04,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2024-11-09 06:50:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 913. [2024-11-09 06:50:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 657 states have (on average 1.23896499238965) internal successors, (814), 665 states have internal predecessors, (814), 148 states have call successors, (148), 107 states have call predecessors, (148), 106 states have return successors, (173), 142 states have call predecessors, (173), 145 states have call successors, (173) [2024-11-09 06:50:04,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1135 transitions. [2024-11-09 06:50:04,774 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1135 transitions. Word has length 91 [2024-11-09 06:50:04,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:50:04,775 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1135 transitions. [2024-11-09 06:50:04,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-09 06:50:04,775 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1135 transitions. [2024-11-09 06:50:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 06:50:04,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:50:04,778 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 06:50:04,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:50:04,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 06:50:04,979 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:50:04,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:04,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1397463424, now seen corresponding path program 1 times [2024-11-09 06:50:04,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:50:04,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219659985] [2024-11-09 06:50:04,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:04,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-09 06:50:05,072 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:50:05,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219659985] [2024-11-09 06:50:05,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219659985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:50:05,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887651998] [2024-11-09 06:50:05,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:05,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:50:05,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:50:05,075 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:50:05,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:50:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:05,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 06:50:05,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:50:05,230 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 06:50:05,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:50:05,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887651998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:05,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:50:05,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 06:50:05,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382998110] [2024-11-09 06:50:05,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:05,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:05,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:50:05,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:05,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:50:05,236 INFO L87 Difference]: Start difference. First operand 913 states and 1135 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-09 06:50:05,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:50:05,478 INFO L93 Difference]: Finished difference Result 1409 states and 1788 transitions. [2024-11-09 06:50:05,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:05,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 91 [2024-11-09 06:50:05,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:50:05,484 INFO L225 Difference]: With dead ends: 1409 [2024-11-09 06:50:05,485 INFO L226 Difference]: Without dead ends: 1016 [2024-11-09 06:50:05,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:50:05,487 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 45 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:50:05,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 340 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:50:05,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2024-11-09 06:50:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 941. [2024-11-09 06:50:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 679 states have (on average 1.2415316642120766) internal successors, (843), 687 states have internal predecessors, (843), 151 states have call successors, (151), 110 states have call predecessors, (151), 109 states have return successors, (176), 145 states have call predecessors, (176), 148 states have call successors, (176) [2024-11-09 06:50:05,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1170 transitions. [2024-11-09 06:50:05,647 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1170 transitions. Word has length 91 [2024-11-09 06:50:05,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:50:05,647 INFO L471 AbstractCegarLoop]: Abstraction has 941 states and 1170 transitions. [2024-11-09 06:50:05,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-09 06:50:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1170 transitions. [2024-11-09 06:50:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 06:50:05,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:50:05,650 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 06:50:05,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 06:50:05,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:50:05,852 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:50:05,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:05,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1525174401, now seen corresponding path program 2 times [2024-11-09 06:50:05,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:50:05,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092140489] [2024-11-09 06:50:05,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:05,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-09 06:50:06,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:50:06,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092140489] [2024-11-09 06:50:06,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092140489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:50:06,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514435857] [2024-11-09 06:50:06,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 06:50:06,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:50:06,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:50:06,024 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:50:06,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 06:50:06,114 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 06:50:06,115 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:50:06,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:50:06,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:50:06,164 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 06:50:06,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:50:06,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514435857] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:06,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:50:06,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-09 06:50:06,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130210438] [2024-11-09 06:50:06,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:06,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:06,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:50:06,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:06,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:50:06,167 INFO L87 Difference]: Start difference. First operand 941 states and 1170 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-09 06:50:06,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:50:06,421 INFO L93 Difference]: Finished difference Result 1479 states and 1912 transitions. [2024-11-09 06:50:06,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:06,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 91 [2024-11-09 06:50:06,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:50:06,430 INFO L225 Difference]: With dead ends: 1479 [2024-11-09 06:50:06,430 INFO L226 Difference]: Without dead ends: 1058 [2024-11-09 06:50:06,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:50:06,433 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 67 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:50:06,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 335 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:50:06,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-11-09 06:50:06,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1036. [2024-11-09 06:50:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 752 states have (on average 1.235372340425532) internal successors, (929), 761 states have internal predecessors, (929), 164 states have call successors, (164), 120 states have call predecessors, (164), 118 states have return successors, (199), 156 states have call predecessors, (199), 161 states have call successors, (199) [2024-11-09 06:50:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1292 transitions. [2024-11-09 06:50:06,692 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1292 transitions. Word has length 91 [2024-11-09 06:50:06,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:50:06,692 INFO L471 AbstractCegarLoop]: Abstraction has 1036 states and 1292 transitions. [2024-11-09 06:50:06,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-09 06:50:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1292 transitions. [2024-11-09 06:50:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 06:50:06,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:50:06,696 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 06:50:06,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 06:50:06,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 06:50:06,902 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:50:06,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:06,902 INFO L85 PathProgramCache]: Analyzing trace with hash -541538891, now seen corresponding path program 1 times [2024-11-09 06:50:06,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:50:06,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276274235] [2024-11-09 06:50:06,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:06,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:07,045 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 06:50:07,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:50:07,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276274235] [2024-11-09 06:50:07,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276274235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:50:07,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341515892] [2024-11-09 06:50:07,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:07,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:50:07,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:50:07,049 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:50:07,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 06:50:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:07,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:50:07,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:50:07,194 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 06:50:07,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:50:07,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341515892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:07,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:50:07,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-09 06:50:07,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280728629] [2024-11-09 06:50:07,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:07,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:50:07,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:50:07,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:50:07,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:50:07,198 INFO L87 Difference]: Start difference. First operand 1036 states and 1292 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-09 06:50:07,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:50:07,460 INFO L93 Difference]: Finished difference Result 1934 states and 2454 transitions. [2024-11-09 06:50:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:50:07,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2024-11-09 06:50:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:50:07,469 INFO L225 Difference]: With dead ends: 1934 [2024-11-09 06:50:07,469 INFO L226 Difference]: Without dead ends: 1279 [2024-11-09 06:50:07,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 06:50:07,473 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 42 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:50:07,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 305 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:50:07,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2024-11-09 06:50:07,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1106. [2024-11-09 06:50:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 806 states have (on average 1.2369727047146402) internal successors, (997), 816 states have internal predecessors, (997), 172 states have call successors, (172), 128 states have call predecessors, (172), 126 states have return successors, (207), 163 states have call predecessors, (207), 169 states have call successors, (207) [2024-11-09 06:50:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1376 transitions. [2024-11-09 06:50:07,687 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1376 transitions. Word has length 92 [2024-11-09 06:50:07,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:50:07,687 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1376 transitions. [2024-11-09 06:50:07,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-09 06:50:07,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1376 transitions. [2024-11-09 06:50:07,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 06:50:07,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:50:07,690 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 06:50:07,711 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 06:50:07,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 06:50:07,895 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:50:07,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:07,896 INFO L85 PathProgramCache]: Analyzing trace with hash -59083107, now seen corresponding path program 1 times [2024-11-09 06:50:07,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:50:07,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883751376] [2024-11-09 06:50:07,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:07,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 06:50:08,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:50:08,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883751376] [2024-11-09 06:50:08,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883751376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:08,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:50:08,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:50:08,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370105072] [2024-11-09 06:50:08,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:08,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:50:08,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:50:08,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:50:08,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:50:08,003 INFO L87 Difference]: Start difference. First operand 1106 states and 1376 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 06:50:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:50:08,455 INFO L93 Difference]: Finished difference Result 2135 states and 2666 transitions. [2024-11-09 06:50:08,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:50:08,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 94 [2024-11-09 06:50:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:50:08,465 INFO L225 Difference]: With dead ends: 2135 [2024-11-09 06:50:08,465 INFO L226 Difference]: Without dead ends: 1611 [2024-11-09 06:50:08,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:50:08,468 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 228 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:50:08,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 349 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:50:08,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2024-11-09 06:50:08,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1570. [2024-11-09 06:50:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1140 states have (on average 1.2289473684210526) internal successors, (1401), 1147 states have internal predecessors, (1401), 250 states have call successors, (250), 180 states have call predecessors, (250), 178 states have return successors, (283), 244 states have call predecessors, (283), 247 states have call successors, (283) [2024-11-09 06:50:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 1934 transitions. [2024-11-09 06:50:08,755 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 1934 transitions. Word has length 94 [2024-11-09 06:50:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:50:08,756 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 1934 transitions. [2024-11-09 06:50:08,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-09 06:50:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1934 transitions. [2024-11-09 06:50:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 06:50:08,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:50:08,759 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 06:50:08,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:50:08,760 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:50:08,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash -294281957, now seen corresponding path program 1 times [2024-11-09 06:50:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:50:08,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935810812] [2024-11-09 06:50:08,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:08,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 06:50:08,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 06:50:08,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935810812] [2024-11-09 06:50:08,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935810812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:50:08,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235628058] [2024-11-09 06:50:08,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:08,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:50:08,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:50:08,973 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:50:08,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 06:50:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:50:09,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 06:50:09,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:50:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-09 06:50:09,202 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:50:09,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235628058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:50:09,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:50:09,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-09 06:50:09,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744053778] [2024-11-09 06:50:09,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:50:09,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 06:50:09,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 06:50:09,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 06:50:09,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 06:50:09,206 INFO L87 Difference]: Start difference. First operand 1570 states and 1934 transitions. Second operand has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 06:50:09,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:50:09,595 INFO L93 Difference]: Finished difference Result 2486 states and 3076 transitions. [2024-11-09 06:50:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 06:50:09,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 101 [2024-11-09 06:50:09,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:50:09,604 INFO L225 Difference]: With dead ends: 2486 [2024-11-09 06:50:09,605 INFO L226 Difference]: Without dead ends: 1379 [2024-11-09 06:50:09,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-09 06:50:09,609 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 39 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:50:09,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 730 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 06:50:09,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-09 06:50:09,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1346. [2024-11-09 06:50:09,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 976 states have (on average 1.2172131147540983) internal successors, (1188), 983 states have internal predecessors, (1188), 214 states have call successors, (214), 156 states have call predecessors, (214), 154 states have return successors, (231), 208 states have call predecessors, (231), 211 states have call successors, (231) [2024-11-09 06:50:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1633 transitions. [2024-11-09 06:50:09,870 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1633 transitions. Word has length 101 [2024-11-09 06:50:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:50:09,871 INFO L471 AbstractCegarLoop]: Abstraction has 1346 states and 1633 transitions. [2024-11-09 06:50:09,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 06:50:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1633 transitions. [2024-11-09 06:50:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 06:50:09,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:50:09,874 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 06:50:09,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 06:50:10,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 06:50:10,075 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 06:50:10,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:50:10,075 INFO L85 PathProgramCache]: Analyzing trace with hash -215629708, now seen corresponding path program 1 times [2024-11-09 06:50:10,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 06:50:10,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198518131] [2024-11-09 06:50:10,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:50:10,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:50:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:50:10,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:50:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:50:10,170 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 06:50:10,170 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:50:10,172 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-09 06:50:10,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-09 06:50:10,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:50:10,178 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:50:10,305 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:50:10,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:50:10 BoogieIcfgContainer [2024-11-09 06:50:10,313 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:50:10,313 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:50:10,313 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:50:10,314 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:50:10,314 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:49:37" (3/4) ... [2024-11-09 06:50:10,315 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 06:50:10,433 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 06:50:10,433 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:50:10,434 INFO L158 Benchmark]: Toolchain (without parser) took 34796.32ms. Allocated memory was 180.4MB in the beginning and 648.0MB in the end (delta: 467.7MB). Free memory was 148.3MB in the beginning and 503.7MB in the end (delta: -355.5MB). Peak memory consumption was 113.0MB. Max. memory is 16.1GB. [2024-11-09 06:50:10,434 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 180.4MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:50:10,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.21ms. Allocated memory is still 180.4MB. Free memory was 148.3MB in the beginning and 129.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 06:50:10,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.84ms. Allocated memory is still 180.4MB. Free memory was 129.3MB in the beginning and 126.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:50:10,435 INFO L158 Benchmark]: Boogie Preprocessor took 57.67ms. Allocated memory is still 180.4MB. Free memory was 126.6MB in the beginning and 124.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:50:10,436 INFO L158 Benchmark]: RCFGBuilder took 1156.08ms. Allocated memory is still 180.4MB. Free memory was 124.5MB in the beginning and 65.7MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-09 06:50:10,437 INFO L158 Benchmark]: TraceAbstraction took 32867.43ms. Allocated memory was 180.4MB in the beginning and 648.0MB in the end (delta: 467.7MB). Free memory was 65.1MB in the beginning and 519.4MB in the end (delta: -454.3MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-11-09 06:50:10,437 INFO L158 Benchmark]: Witness Printer took 120.34ms. Allocated memory is still 648.0MB. Free memory was 518.4MB in the beginning and 503.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 06:50:10,439 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.32ms. Allocated memory is still 180.4MB. Free memory is still 152.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.21ms. Allocated memory is still 180.4MB. Free memory was 148.3MB in the beginning and 129.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.84ms. Allocated memory is still 180.4MB. Free memory was 129.3MB in the beginning and 126.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.67ms. Allocated memory is still 180.4MB. Free memory was 126.6MB in the beginning and 124.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1156.08ms. Allocated memory is still 180.4MB. Free memory was 124.5MB in the beginning and 65.7MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 32867.43ms. Allocated memory was 180.4MB in the beginning and 648.0MB in the end (delta: 467.7MB). Free memory was 65.1MB in the beginning and 519.4MB in the end (delta: -454.3MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Witness Printer took 120.34ms. Allocated memory is still 648.0MB. Free memory was 518.4MB in the beginning and 503.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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 ; [L974] COND FALSE !(__VERIFIER_nondet_int()) [L977] CALL main2() [L961] int __retres1 ; [L965] CALL init_model2() [L876] m_i = 1 [L877] t1_i = 1 [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 [L663] COND TRUE t1_i == 1 [L664] t1_st = 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) [L752] COND FALSE !(T1_E == 0) [L757] COND FALSE !(E_M == 0) [L762] COND FALSE !(E_1 == 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); [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) [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); [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___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) [L780] COND FALSE !(T1_E == 1) [L785] COND FALSE !(E_M == 1) [L790] COND FALSE !(E_1 == 1) [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 [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 ; [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 [L689] return (__retres1); [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 [L589] t1_pc = 1 [L590] t1_st = 2 [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 ; [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 [L689] return (__retres1); [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 [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); [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND FALSE !(\read(tmp)) [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); [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND TRUE \read(tmp___0) [L816] t1_st = 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 [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); [L805] RET, EXPR is_master_triggered() [L805] tmp = is_master_triggered() [L807] COND TRUE \read(tmp) [L808] m_st = 0 [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); [L813] RET, EXPR is_transmit1_triggered() [L813] tmp___0 = is_transmit1_triggered() [L815] COND FALSE !(\read(tmp___0)) [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 [L589] t1_pc = 1 [L590] t1_st = 2 [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 ; [L676] COND TRUE m_st == 0 [L677] __retres1 = 1 [L689] return (__retres1); [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) [L550] COND TRUE tmp_var <= 5 [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, 147 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 32.7s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3126 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3080 mSDsluCounter, 7473 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4402 mSDsCounter, 795 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4775 IncrementalHoareTripleChecker+Invalid, 5570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 795 mSolverCounterUnsat, 3071 mSDtfsCounter, 4775 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 770 GetRequests, 640 SyntacticMatches, 3 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1570occurred in iteration=16, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 968 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1743 NumberOfCodeBlocks, 1707 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1677 ConstructedInterpolants, 0 QuantifiedInterpolants, 3002 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1929 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 24 InterpolantComputations, 16 PerfectInterpolantSequences, 602/652 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: OVERALL_TIME: 3.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 8, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 54, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 59, TOOLS_POST_TIME: 1.1s, TOOLS_POST_CALL_APPLICATIONS: 25, TOOLS_POST_CALL_TIME: 0.8s, TOOLS_POST_RETURN_APPLICATIONS: 18, TOOLS_POST_RETURN_TIME: 0.6s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 102, TOOLS_QUANTIFIERELIM_TIME: 2.6s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 162, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 21, DOMAIN_JOIN_TIME: 0.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME: 0.1s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 54, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 18, CALL_SUMMARIZER_CACHE_MISSES: 7, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 888, DAG_COMPRESSION_RETAINED_NODES: 150, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-09 06:50:10,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40f276c0-5874-41ab-bb22-c5033b58a5b1/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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