./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fb1091d73aa20044da5f23529d9b458b78a9fc672c28c9226a1c2bddab62484e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 14:53:11,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 14:53:11,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 14:53:11,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 14:53:11,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 14:53:11,560 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 14:53:11,561 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 14:53:11,567 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 14:53:11,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 14:53:11,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 14:53:11,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 14:53:11,574 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 14:53:11,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 14:53:11,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 14:53:11,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 14:53:11,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 14:53:11,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 14:53:11,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 14:53:11,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 14:53:11,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 14:53:11,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 14:53:11,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 14:53:11,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 14:53:11,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 14:53:11,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 14:53:11,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 14:53:11,593 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 14:53:11,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 14:53:11,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 14:53:11,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 14:53:11,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 14:53:11,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 14:53:11,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 14:53:11,597 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 14:53:11,598 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 14:53:11,598 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 14:53:11,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 14:53:11,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 14:53:11,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 14:53:11,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 14:53:11,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 14:53:11,602 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 14:53:11,620 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 14:53:11,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 14:53:11,621 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 14:53:11,621 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 14:53:11,622 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 14:53:11,622 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 14:53:11,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 14:53:11,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 14:53:11,623 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 14:53:11,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 14:53:11,624 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 14:53:11,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 14:53:11,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 14:53:11,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 14:53:11,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 14:53:11,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 14:53:11,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 14:53:11,625 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 14:53:11,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 14:53:11,626 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 14:53:11,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 14:53:11,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 14:53:11,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 14:53:11,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 14:53:11,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 14:53:11,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 14:53:11,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 14:53:11,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 14:53:11,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 14:53:11,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 14:53:11,628 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 14:53:11,628 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 14:53:11,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 14:53:11,629 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 14:53:11,629 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb1091d73aa20044da5f23529d9b458b78a9fc672c28c9226a1c2bddab62484e [2021-12-21 14:53:11,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 14:53:11,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 14:53:11,875 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 14:53:11,876 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 14:53:11,877 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 14:53:11,878 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2021-12-21 14:53:11,929 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08b4441e3/01e783fe6584421181843082ed3fda4e/FLAGa70c491e3 [2021-12-21 14:53:12,379 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 14:53:12,379 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2021-12-21 14:53:12,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08b4441e3/01e783fe6584421181843082ed3fda4e/FLAGa70c491e3 [2021-12-21 14:53:12,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08b4441e3/01e783fe6584421181843082ed3fda4e [2021-12-21 14:53:12,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 14:53:12,739 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 14:53:12,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 14:53:12,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 14:53:12,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 14:53:12,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:53:12" (1/1) ... [2021-12-21 14:53:12,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@128f103e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:53:12, skipping insertion in model container [2021-12-21 14:53:12,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 02:53:12" (1/1) ... [2021-12-21 14:53:12,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 14:53:12,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 14:53:12,960 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c[914,927] [2021-12-21 14:53:12,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c[7125,7138] [2021-12-21 14:53:13,050 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 14:53:13,058 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 14:53:13,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c[914,927] [2021-12-21 14:53:13,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.07.cil-1.c[7125,7138] [2021-12-21 14:53:13,137 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 14:53:13,166 INFO L208 MainTranslator]: Completed translation [2021-12-21 14:53:13,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:53:13 WrapperNode [2021-12-21 14:53:13,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 14:53:13,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 14:53:13,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 14:53:13,168 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 14:53:13,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:53:13" (1/1) ... [2021-12-21 14:53:13,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:53:13" (1/1) ... [2021-12-21 14:53:13,233 INFO L137 Inliner]: procedures = 67, calls = 79, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 751 [2021-12-21 14:53:13,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 14:53:13,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 14:53:13,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 14:53:13,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 14:53:13,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:53:13" (1/1) ... [2021-12-21 14:53:13,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:53:13" (1/1) ... [2021-12-21 14:53:13,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:53:13" (1/1) ... [2021-12-21 14:53:13,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:53:13" (1/1) ... [2021-12-21 14:53:13,258 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:53:13" (1/1) ... [2021-12-21 14:53:13,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:53:13" (1/1) ... [2021-12-21 14:53:13,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:53:13" (1/1) ... [2021-12-21 14:53:13,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 14:53:13,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 14:53:13,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 14:53:13,284 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 14:53:13,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:53:13" (1/1) ... [2021-12-21 14:53:13,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 14:53:13,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 14:53:13,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-21 14:53:13,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-21 14:53:13,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 14:53:13,360 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-21 14:53:13,360 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-21 14:53:13,360 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-21 14:53:13,361 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-21 14:53:13,361 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-21 14:53:13,361 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-21 14:53:13,361 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-21 14:53:13,361 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-21 14:53:13,361 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-21 14:53:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-21 14:53:13,362 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-21 14:53:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-21 14:53:13,362 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-21 14:53:13,362 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-21 14:53:13,362 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-21 14:53:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-21 14:53:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-21 14:53:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-21 14:53:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-21 14:53:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-21 14:53:13,363 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-21 14:53:13,363 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-21 14:53:13,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 14:53:13,364 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-21 14:53:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-21 14:53:13,364 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-21 14:53:13,364 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-21 14:53:13,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 14:53:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 14:53:13,365 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-21 14:53:13,365 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-21 14:53:13,513 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 14:53:13,515 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 14:53:14,214 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 14:53:14,224 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 14:53:14,224 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2021-12-21 14:53:14,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:53:14 BoogieIcfgContainer [2021-12-21 14:53:14,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 14:53:14,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 14:53:14,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 14:53:14,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 14:53:14,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 02:53:12" (1/3) ... [2021-12-21 14:53:14,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25caf5d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:53:14, skipping insertion in model container [2021-12-21 14:53:14,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 02:53:13" (2/3) ... [2021-12-21 14:53:14,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25caf5d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 02:53:14, skipping insertion in model container [2021-12-21 14:53:14,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:53:14" (3/3) ... [2021-12-21 14:53:14,237 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.07.cil-1.c [2021-12-21 14:53:14,241 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 14:53:14,244 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-21 14:53:14,283 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 14:53:14,288 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-21 14:53:14,289 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-21 14:53:14,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 359 states, 306 states have (on average 1.6143790849673203) internal successors, (494), 313 states have internal predecessors, (494), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2021-12-21 14:53:14,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-21 14:53:14,330 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 14:53:14,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:53:14,331 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 14:53:14,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:53:14,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1357445742, now seen corresponding path program 1 times [2021-12-21 14:53:14,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:53:14,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443050456] [2021-12-21 14:53:14,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:53:14,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:53:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:14,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-21 14:53:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:14,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 14:53:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:14,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 14:53:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:14,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 14:53:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:14,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 14:53:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:14,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-21 14:53:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:14,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 14:53:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:53:14,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:53:14,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443050456] [2021-12-21 14:53:14,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443050456] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:53:14,673 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:53:14,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 14:53:14,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633174369] [2021-12-21 14:53:14,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:53:14,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-21 14:53:14,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:53:14,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 14:53:14,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-21 14:53:14,711 INFO L87 Difference]: Start difference. First operand has 359 states, 306 states have (on average 1.6143790849673203) internal successors, (494), 313 states have internal predecessors, (494), 36 states have call successors, (36), 14 states have call predecessors, (36), 14 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-21 14:53:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 14:53:15,333 INFO L93 Difference]: Finished difference Result 714 states and 1123 transitions. [2021-12-21 14:53:15,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 14:53:15,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-21 14:53:15,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 14:53:15,359 INFO L225 Difference]: With dead ends: 714 [2021-12-21 14:53:15,359 INFO L226 Difference]: Without dead ends: 367 [2021-12-21 14:53:15,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-21 14:53:15,367 INFO L933 BasicCegarLoop]: 524 mSDtfsCounter, 771 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-21 14:53:15,368 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [782 Valid, 1224 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-21 14:53:15,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-12-21 14:53:15,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 349. [2021-12-21 14:53:15,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 298 states have (on average 1.5201342281879195) internal successors, (453), 303 states have internal predecessors, (453), 36 states have call successors, (36), 14 states have call predecessors, (36), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2021-12-21 14:53:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 522 transitions. [2021-12-21 14:53:15,439 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 522 transitions. Word has length 59 [2021-12-21 14:53:15,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 14:53:15,439 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 522 transitions. [2021-12-21 14:53:15,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-21 14:53:15,440 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 522 transitions. [2021-12-21 14:53:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-21 14:53:15,446 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 14:53:15,446 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:53:15,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 14:53:15,448 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 14:53:15,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:53:15,449 INFO L85 PathProgramCache]: Analyzing trace with hash -876365484, now seen corresponding path program 1 times [2021-12-21 14:53:15,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:53:15,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095012443] [2021-12-21 14:53:15,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:53:15,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:53:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:15,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-21 14:53:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:15,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 14:53:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:15,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 14:53:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:15,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 14:53:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:15,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 14:53:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:15,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-21 14:53:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:15,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 14:53:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:53:15,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:53:15,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095012443] [2021-12-21 14:53:15,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095012443] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:53:15,646 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:53:15,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 14:53:15,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128310712] [2021-12-21 14:53:15,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:53:15,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 14:53:15,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:53:15,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 14:53:15,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-21 14:53:15,650 INFO L87 Difference]: Start difference. First operand 349 states and 522 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-21 14:53:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 14:53:16,465 INFO L93 Difference]: Finished difference Result 574 states and 838 transitions. [2021-12-21 14:53:16,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 14:53:16,466 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-21 14:53:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 14:53:16,471 INFO L225 Difference]: With dead ends: 574 [2021-12-21 14:53:16,471 INFO L226 Difference]: Without dead ends: 485 [2021-12-21 14:53:16,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-21 14:53:16,477 INFO L933 BasicCegarLoop]: 530 mSDtfsCounter, 1138 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-21 14:53:16,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1143 Valid, 1531 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-21 14:53:16,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2021-12-21 14:53:16,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 445. [2021-12-21 14:53:16,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 374 states have (on average 1.4893048128342246) internal successors, (557), 381 states have internal predecessors, (557), 47 states have call successors, (47), 21 states have call predecessors, (47), 22 states have return successors, (49), 45 states have call predecessors, (49), 44 states have call successors, (49) [2021-12-21 14:53:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 653 transitions. [2021-12-21 14:53:16,539 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 653 transitions. Word has length 59 [2021-12-21 14:53:16,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 14:53:16,539 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 653 transitions. [2021-12-21 14:53:16,540 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-21 14:53:16,540 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 653 transitions. [2021-12-21 14:53:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-21 14:53:16,544 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 14:53:16,544 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:53:16,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 14:53:16,545 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 14:53:16,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:53:16,545 INFO L85 PathProgramCache]: Analyzing trace with hash -637036524, now seen corresponding path program 1 times [2021-12-21 14:53:16,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:53:16,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111778689] [2021-12-21 14:53:16,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:53:16,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:53:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:16,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-21 14:53:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:16,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 14:53:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:16,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 14:53:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:16,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 14:53:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:16,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 14:53:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:16,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-21 14:53:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:16,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 14:53:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:53:16,666 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:53:16,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111778689] [2021-12-21 14:53:16,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111778689] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:53:16,666 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:53:16,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 14:53:16,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528651122] [2021-12-21 14:53:16,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:53:16,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 14:53:16,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:53:16,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 14:53:16,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-21 14:53:16,668 INFO L87 Difference]: Start difference. First operand 445 states and 653 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-21 14:53:17,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 14:53:17,525 INFO L93 Difference]: Finished difference Result 794 states and 1131 transitions. [2021-12-21 14:53:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-21 14:53:17,526 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-21 14:53:17,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 14:53:17,530 INFO L225 Difference]: With dead ends: 794 [2021-12-21 14:53:17,530 INFO L226 Difference]: Without dead ends: 616 [2021-12-21 14:53:17,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-21 14:53:17,531 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 1018 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 1086 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 2066 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-21 14:53:17,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1045 Valid, 2066 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1086 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-21 14:53:17,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2021-12-21 14:53:17,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 541. [2021-12-21 14:53:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 450 states have (on average 1.4666666666666666) internal successors, (660), 459 states have internal predecessors, (660), 58 states have call successors, (58), 28 states have call predecessors, (58), 31 states have return successors, (68), 57 states have call predecessors, (68), 55 states have call successors, (68) [2021-12-21 14:53:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 786 transitions. [2021-12-21 14:53:17,562 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 786 transitions. Word has length 59 [2021-12-21 14:53:17,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 14:53:17,562 INFO L470 AbstractCegarLoop]: Abstraction has 541 states and 786 transitions. [2021-12-21 14:53:17,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-21 14:53:17,563 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 786 transitions. [2021-12-21 14:53:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-21 14:53:17,564 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 14:53:17,564 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:53:17,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 14:53:17,564 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 14:53:17,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:53:17,565 INFO L85 PathProgramCache]: Analyzing trace with hash 256449814, now seen corresponding path program 1 times [2021-12-21 14:53:17,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:53:17,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285769168] [2021-12-21 14:53:17,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:53:17,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:53:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:17,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-21 14:53:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:17,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 14:53:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:17,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 14:53:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:17,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 14:53:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:17,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 14:53:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:17,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-21 14:53:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:17,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 14:53:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:53:17,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:53:17,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285769168] [2021-12-21 14:53:17,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285769168] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:53:17,659 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:53:17,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 14:53:17,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524580312] [2021-12-21 14:53:17,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:53:17,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 14:53:17,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:53:17,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 14:53:17,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-21 14:53:17,661 INFO L87 Difference]: Start difference. First operand 541 states and 786 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-21 14:53:18,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 14:53:18,430 INFO L93 Difference]: Finished difference Result 869 states and 1241 transitions. [2021-12-21 14:53:18,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 14:53:18,431 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2021-12-21 14:53:18,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 14:53:18,434 INFO L225 Difference]: With dead ends: 869 [2021-12-21 14:53:18,434 INFO L226 Difference]: Without dead ends: 601 [2021-12-21 14:53:18,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-21 14:53:18,435 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 447 mSDsluCounter, 1921 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 2433 SdHoareTripleChecker+Invalid, 1188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-21 14:53:18,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [449 Valid, 2433 Invalid, 1188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-21 14:53:18,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2021-12-21 14:53:18,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 556. [2021-12-21 14:53:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 462 states have (on average 1.4545454545454546) internal successors, (672), 471 states have internal predecessors, (672), 58 states have call successors, (58), 28 states have call predecessors, (58), 34 states have return successors, (71), 60 states have call predecessors, (71), 55 states have call successors, (71) [2021-12-21 14:53:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 801 transitions. [2021-12-21 14:53:18,461 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 801 transitions. Word has length 59 [2021-12-21 14:53:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 14:53:18,462 INFO L470 AbstractCegarLoop]: Abstraction has 556 states and 801 transitions. [2021-12-21 14:53:18,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-21 14:53:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 801 transitions. [2021-12-21 14:53:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-21 14:53:18,463 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 14:53:18,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:53:18,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-21 14:53:18,464 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 14:53:18,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:53:18,465 INFO L85 PathProgramCache]: Analyzing trace with hash 2061888148, now seen corresponding path program 1 times [2021-12-21 14:53:18,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:53:18,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828899586] [2021-12-21 14:53:18,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:53:18,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:53:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:18,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-21 14:53:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:18,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 14:53:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:18,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 14:53:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:18,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 14:53:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:18,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 14:53:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:18,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-21 14:53:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:18,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 14:53:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:53:18,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:53:18,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828899586] [2021-12-21 14:53:18,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828899586] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:53:18,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:53:18,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-21 14:53:18,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772297446] [2021-12-21 14:53:18,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:53:18,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-21 14:53:18,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:53:18,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-21 14:53:18,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-21 14:53:18,588 INFO L87 Difference]: Start difference. First operand 556 states and 801 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-21 14:53:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 14:53:19,377 INFO L93 Difference]: Finished difference Result 875 states and 1234 transitions. [2021-12-21 14:53:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 14:53:19,377 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2021-12-21 14:53:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 14:53:19,381 INFO L225 Difference]: With dead ends: 875 [2021-12-21 14:53:19,381 INFO L226 Difference]: Without dead ends: 592 [2021-12-21 14:53:19,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-21 14:53:19,383 INFO L933 BasicCegarLoop]: 509 mSDtfsCounter, 668 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-21 14:53:19,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 2183 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-21 14:53:19,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2021-12-21 14:53:19,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 561. [2021-12-21 14:53:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 466 states have (on average 1.446351931330472) internal successors, (674), 475 states have internal predecessors, (674), 58 states have call successors, (58), 28 states have call predecessors, (58), 35 states have return successors, (72), 61 states have call predecessors, (72), 55 states have call successors, (72) [2021-12-21 14:53:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 804 transitions. [2021-12-21 14:53:19,407 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 804 transitions. Word has length 59 [2021-12-21 14:53:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 14:53:19,408 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 804 transitions. [2021-12-21 14:53:19,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-21 14:53:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 804 transitions. [2021-12-21 14:53:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-21 14:53:19,409 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 14:53:19,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:53:19,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 14:53:19,410 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 14:53:19,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:53:19,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1958319534, now seen corresponding path program 1 times [2021-12-21 14:53:19,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:53:19,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154793020] [2021-12-21 14:53:19,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:53:19,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:53:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:19,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-21 14:53:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:19,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 14:53:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:19,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 14:53:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:19,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 14:53:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:19,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 14:53:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:19,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-21 14:53:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:19,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 14:53:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:53:19,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:53:19,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154793020] [2021-12-21 14:53:19,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154793020] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:53:19,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:53:19,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-21 14:53:19,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183304680] [2021-12-21 14:53:19,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:53:19,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-21 14:53:19,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:53:19,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-21 14:53:19,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-21 14:53:19,507 INFO L87 Difference]: Start difference. First operand 561 states and 804 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-21 14:53:21,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 14:53:21,109 INFO L93 Difference]: Finished difference Result 1931 states and 2655 transitions. [2021-12-21 14:53:21,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-21 14:53:21,110 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2021-12-21 14:53:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 14:53:21,118 INFO L225 Difference]: With dead ends: 1931 [2021-12-21 14:53:21,118 INFO L226 Difference]: Without dead ends: 1625 [2021-12-21 14:53:21,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-21 14:53:21,121 INFO L933 BasicCegarLoop]: 618 mSDtfsCounter, 2735 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 603 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2750 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 603 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-21 14:53:21,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2750 Valid, 2326 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [603 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-21 14:53:21,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2021-12-21 14:53:21,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1477. [2021-12-21 14:53:21,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1193 states have (on average 1.363788767812238) internal successors, (1627), 1217 states have internal predecessors, (1627), 146 states have call successors, (146), 111 states have call predecessors, (146), 136 states have return successors, (189), 151 states have call predecessors, (189), 143 states have call successors, (189) [2021-12-21 14:53:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 1962 transitions. [2021-12-21 14:53:21,212 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 1962 transitions. Word has length 59 [2021-12-21 14:53:21,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 14:53:21,213 INFO L470 AbstractCegarLoop]: Abstraction has 1477 states and 1962 transitions. [2021-12-21 14:53:21,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-21 14:53:21,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 1962 transitions. [2021-12-21 14:53:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-21 14:53:21,215 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 14:53:21,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:53:21,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-21 14:53:21,215 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 14:53:21,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:53:21,216 INFO L85 PathProgramCache]: Analyzing trace with hash -440465259, now seen corresponding path program 1 times [2021-12-21 14:53:21,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:53:21,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454523469] [2021-12-21 14:53:21,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:53:21,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:53:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:21,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-21 14:53:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:21,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-21 14:53:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:21,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-21 14:53:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:21,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-21 14:53:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:21,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-21 14:53:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:21,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-21 14:53:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:21,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-21 14:53:21,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 14:53:21,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 14:53:21,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 14:53:21,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454523469] [2021-12-21 14:53:21,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454523469] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 14:53:21,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 14:53:21,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 14:53:21,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818290999] [2021-12-21 14:53:21,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 14:53:21,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 14:53:21,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 14:53:21,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 14:53:21,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-21 14:53:21,318 INFO L87 Difference]: Start difference. First operand 1477 states and 1962 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-21 14:53:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 14:53:22,184 INFO L93 Difference]: Finished difference Result 2758 states and 3550 transitions. [2021-12-21 14:53:22,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-21 14:53:22,185 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-21 14:53:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-21 14:53:22,193 INFO L225 Difference]: With dead ends: 2758 [2021-12-21 14:53:22,193 INFO L226 Difference]: Without dead ends: 1765 [2021-12-21 14:53:22,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2021-12-21 14:53:22,198 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 1273 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-21 14:53:22,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1297 Valid, 1542 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-21 14:53:22,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2021-12-21 14:53:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1419. [2021-12-21 14:53:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1151 states have (on average 1.3596872284969592) internal successors, (1565), 1170 states have internal predecessors, (1565), 140 states have call successors, (140), 106 states have call predecessors, (140), 126 states have return successors, (174), 144 states have call predecessors, (174), 137 states have call successors, (174) [2021-12-21 14:53:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1879 transitions. [2021-12-21 14:53:22,294 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1879 transitions. Word has length 59 [2021-12-21 14:53:22,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-21 14:53:22,295 INFO L470 AbstractCegarLoop]: Abstraction has 1419 states and 1879 transitions. [2021-12-21 14:53:22,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-21 14:53:22,295 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1879 transitions. [2021-12-21 14:53:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-21 14:53:22,296 INFO L506 BasicCegarLoop]: Found error trace [2021-12-21 14:53:22,296 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:53:22,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-21 14:53:22,297 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-21 14:53:22,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 14:53:22,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1860357331, now seen corresponding path program 1 times [2021-12-21 14:53:22,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 14:53:22,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996876280] [2021-12-21 14:53:22,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 14:53:22,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 14:53:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 14:53:22,311 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 14:53:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 14:53:22,358 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 14:53:22,359 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-21 14:53:22,360 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-21 14:53:22,361 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-21 14:53:22,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-21 14:53:22,365 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 14:53:22,368 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-21 14:53:22,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 02:53:22 BoogieIcfgContainer [2021-12-21 14:53:22,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-21 14:53:22,470 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 14:53:22,470 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 14:53:22,470 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 14:53:22,471 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 02:53:14" (3/4) ... [2021-12-21 14:53:22,472 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-21 14:53:22,562 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 14:53:22,562 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 14:53:22,563 INFO L158 Benchmark]: Toolchain (without parser) took 9823.61ms. Allocated memory was 98.6MB in the beginning and 209.7MB in the end (delta: 111.1MB). Free memory was 70.4MB in the beginning and 111.3MB in the end (delta: -40.9MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. [2021-12-21 14:53:22,563 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 98.6MB. Free memory is still 55.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 14:53:22,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.30ms. Allocated memory is still 98.6MB. Free memory was 70.2MB in the beginning and 64.4MB in the end (delta: 5.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-21 14:53:22,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.80ms. Allocated memory is still 98.6MB. Free memory was 64.4MB in the beginning and 60.7MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 14:53:22,564 INFO L158 Benchmark]: Boogie Preprocessor took 48.62ms. Allocated memory is still 98.6MB. Free memory was 60.7MB in the beginning and 57.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-21 14:53:22,564 INFO L158 Benchmark]: RCFGBuilder took 942.91ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 57.4MB in the beginning and 94.4MB in the end (delta: -37.0MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2021-12-21 14:53:22,565 INFO L158 Benchmark]: TraceAbstraction took 8241.80ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 93.7MB in the beginning and 127.1MB in the end (delta: -33.3MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2021-12-21 14:53:22,565 INFO L158 Benchmark]: Witness Printer took 92.48ms. Allocated memory is still 209.7MB. Free memory was 127.1MB in the beginning and 111.3MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-21 14:53:22,567 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 98.6MB. Free memory is still 55.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.30ms. Allocated memory is still 98.6MB. Free memory was 70.2MB in the beginning and 64.4MB in the end (delta: 5.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.80ms. Allocated memory is still 98.6MB. Free memory was 64.4MB in the beginning and 60.7MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.62ms. Allocated memory is still 98.6MB. Free memory was 60.7MB in the beginning and 57.4MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 942.91ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 57.4MB in the beginning and 94.4MB in the end (delta: -37.0MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8241.80ms. Allocated memory was 144.7MB in the beginning and 209.7MB in the end (delta: 65.0MB). Free memory was 93.7MB in the beginning and 127.1MB in the end (delta: -33.3MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * Witness Printer took 92.48ms. Allocated memory is still 209.7MB. Free memory was 127.1MB in the beginning and 111.3MB in the end (delta: 15.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: 28]: 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 t2_pc = 0; [L503] int t3_pc = 0; [L504] int t4_pc = 0; [L505] int t5_pc = 0; [L506] int t6_pc = 0; [L507] int t7_pc = 0; [L508] int m_st ; [L509] int t1_st ; [L510] int t2_st ; [L511] int t3_st ; [L512] int t4_st ; [L513] int t5_st ; [L514] int t6_st ; [L515] int t7_st ; [L516] int m_i ; [L517] int t1_i ; [L518] int t2_i ; [L519] int t3_i ; [L520] int t4_i ; [L521] int t5_i ; [L522] int t6_i ; [L523] int t7_i ; [L524] int M_E = 2; [L525] int T1_E = 2; [L526] int T2_E = 2; [L527] int T3_E = 2; [L528] int T4_E = 2; [L529] int T5_E = 2; [L530] int T6_E = 2; [L531] int T7_E = 2; [L532] int E_M = 2; [L533] int E_1 = 2; [L534] int E_2 = 2; [L535] int E_3 = 2; [L536] int E_4 = 2; [L537] int E_5 = 2; [L538] int E_6 = 2; [L539] int E_7 = 2; [L549] int token ; [L551] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L1712] COND TRUE __VERIFIER_nondet_int() [L1713] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L420] CALL update_channels1() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L230] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L420] RET update_channels1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L283] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L288] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L422] RET fire_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L423] CALL activate_threads1() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L321] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L70] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L83] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L85] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L321] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, is_do_write_p_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L89] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L102] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L104] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L329] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, is_do_read_c_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L424] CALL reset_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L301] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L306] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L424] RET reset_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L427] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L347] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L350] CALL, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L260] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L276] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L350] RET, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, exists_runnable_thread1()=1, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] [L28] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_3=2, E_4=2, E_5=2, E_6=2, E_7=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, 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=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, T4_E=2, t4_i=0, t4_pc=0, t4_st=0, T5_E=2, t5_i=0, t5_pc=0, t5_st=0, T6_E=2, t6_i=0, t6_pc=0, t6_st=0, T7_E=2, t7_i=0, t7_pc=0, t7_st=0, token=0] - UnprovableResult [Line: 496]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 359 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8135 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8050 mSDsluCounter, 13305 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9517 mSDsCounter, 1510 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6756 IncrementalHoareTripleChecker+Invalid, 8266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1510 mSolverCounterUnsat, 3788 mSDtfsCounter, 6756 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 258 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1477occurred in iteration=6, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 703 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 406 ConstructedInterpolants, 0 QuantifiedInterpolants, 854 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-21 14:53:22,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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