./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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_3.cil+token_ring.02.cil-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 08:09:33,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 08:09:33,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 08:09:33,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 08:09:33,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 08:09:33,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 08:09:33,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 08:09:33,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 08:09:33,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 08:09:33,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 08:09:33,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 08:09:33,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 08:09:33,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 08:09:33,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 08:09:33,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 08:09:33,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 08:09:33,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 08:09:33,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 08:09:33,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 08:09:33,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 08:09:33,569 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 08:09:33,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 08:09:33,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 08:09:33,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 08:09:33,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 08:09:33,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 08:09:33,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 08:09:33,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 08:09:33,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 08:09:33,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 08:09:33,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 08:09:33,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 08:09:33,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 08:09:33,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 08:09:33,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 08:09:33,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 08:09:33,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 08:09:33,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 08:09:33,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 08:09:33,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 08:09:33,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 08:09:33,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 08:09:33,592 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 08:09:33,617 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 08:09:33,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 08:09:33,618 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 08:09:33,618 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 08:09:33,618 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 08:09:33,618 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 08:09:33,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 08:09:33,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 08:09:33,619 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 08:09:33,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 08:09:33,620 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 08:09:33,621 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 08:09:33,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 08:09:33,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 08:09:33,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 08:09:33,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 08:09:33,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 08:09:33,622 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 08:09:33,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 08:09:33,622 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 08:09:33,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 08:09:33,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 08:09:33,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 08:09:33,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 08:09:33,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:09:33,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 08:09:33,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 08:09:33,623 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 08:09:33,624 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 08:09:33,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 08:09:33,624 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 08:09:33,624 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 08:09:33,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 08:09:33,624 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 -> d9dd329404607c04c3b8409033c911abc5eb1af40daa0f8673d76c8f1e85e1ae [2022-07-21 08:09:33,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 08:09:33,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 08:09:33,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 08:09:33,935 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 08:09:33,935 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 08:09:33,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c [2022-07-21 08:09:33,982 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8efe0f63/160517f3c483410fada3337228bdd7b2/FLAG36ad423e7 [2022-07-21 08:09:34,356 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 08:09:34,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.02.cil-2.c [2022-07-21 08:09:34,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8efe0f63/160517f3c483410fada3337228bdd7b2/FLAG36ad423e7 [2022-07-21 08:09:34,379 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8efe0f63/160517f3c483410fada3337228bdd7b2 [2022-07-21 08:09:34,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 08:09:34,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 08:09:34,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 08:09:34,384 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 08:09:34,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 08:09:34,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:09:34" (1/1) ... [2022-07-21 08:09:34,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a22f2e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:34, skipping insertion in model container [2022-07-21 08:09:34,388 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 08:09:34" (1/1) ... [2022-07-21 08:09:34,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 08:09:34,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 08:09:34,541 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_3.cil+token_ring.02.cil-2.c[911,924] [2022-07-21 08:09:34,626 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_3.cil+token_ring.02.cil-2.c[8416,8429] [2022-07-21 08:09:34,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:09:34,678 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 08:09:34,690 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_3.cil+token_ring.02.cil-2.c[911,924] [2022-07-21 08:09:34,703 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_3.cil+token_ring.02.cil-2.c[8416,8429] [2022-07-21 08:09:34,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 08:09:34,725 INFO L208 MainTranslator]: Completed translation [2022-07-21 08:09:34,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:34 WrapperNode [2022-07-21 08:09:34,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 08:09:34,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 08:09:34,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 08:09:34,727 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 08:09:34,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:34" (1/1) ... [2022-07-21 08:09:34,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:34" (1/1) ... [2022-07-21 08:09:34,778 INFO L137 Inliner]: procedures = 59, calls = 68, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 503 [2022-07-21 08:09:34,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 08:09:34,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 08:09:34,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 08:09:34,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 08:09:34,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:34" (1/1) ... [2022-07-21 08:09:34,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:34" (1/1) ... [2022-07-21 08:09:34,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:34" (1/1) ... [2022-07-21 08:09:34,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:34" (1/1) ... [2022-07-21 08:09:34,802 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:34" (1/1) ... [2022-07-21 08:09:34,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:34" (1/1) ... [2022-07-21 08:09:34,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:34" (1/1) ... [2022-07-21 08:09:34,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 08:09:34,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 08:09:34,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 08:09:34,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 08:09:34,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:34" (1/1) ... [2022-07-21 08:09:34,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 08:09:34,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:09:34,839 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) [2022-07-21 08:09:34,845 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 [2022-07-21 08:09:34,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 08:09:34,863 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-21 08:09:34,863 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-21 08:09:34,863 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-21 08:09:34,864 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-21 08:09:34,864 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-21 08:09:34,864 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-21 08:09:34,864 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-21 08:09:34,864 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-21 08:09:34,864 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-07-21 08:09:34,864 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-07-21 08:09:34,864 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-21 08:09:34,865 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-21 08:09:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-21 08:09:34,865 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-21 08:09:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-07-21 08:09:34,865 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-07-21 08:09:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-21 08:09:34,865 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-21 08:09:34,865 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-07-21 08:09:34,865 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-07-21 08:09:34,866 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-21 08:09:34,866 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-21 08:09:34,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 08:09:34,866 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-21 08:09:34,866 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-21 08:09:34,866 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-07-21 08:09:34,866 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-07-21 08:09:34,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 08:09:34,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 08:09:34,867 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-21 08:09:34,867 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-21 08:09:34,867 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-07-21 08:09:34,867 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-07-21 08:09:35,010 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 08:09:35,012 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 08:09:35,396 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-07-21 08:09:35,396 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-07-21 08:09:35,438 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 08:09:35,444 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 08:09:35,444 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-21 08:09:35,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:09:35 BoogieIcfgContainer [2022-07-21 08:09:35,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 08:09:35,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 08:09:35,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 08:09:35,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 08:09:35,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 08:09:34" (1/3) ... [2022-07-21 08:09:35,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59691f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:09:35, skipping insertion in model container [2022-07-21 08:09:35,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 08:09:34" (2/3) ... [2022-07-21 08:09:35,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59691f30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 08:09:35, skipping insertion in model container [2022-07-21 08:09:35,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:09:35" (3/3) ... [2022-07-21 08:09:35,451 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-2.c [2022-07-21 08:09:35,469 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 08:09:35,469 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-21 08:09:35,515 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 08:09:35,521 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5f884ba5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6b5f54ab [2022-07-21 08:09:35,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-21 08:09:35,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 257 states, 205 states have (on average 1.5658536585365854) internal successors, (321), 213 states have internal predecessors, (321), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2022-07-21 08:09:35,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 08:09:35,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:35,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:35,534 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:35,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:35,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1020803089, now seen corresponding path program 1 times [2022-07-21 08:09:35,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:35,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987698307] [2022-07-21 08:09:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:35,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:35,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:35,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:35,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:35,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:35,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:09:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:35,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:09:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:35,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:09:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:35,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:09:35,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:35,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987698307] [2022-07-21 08:09:35,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987698307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:35,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:35,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:09:35,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033300254] [2022-07-21 08:09:35,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:35,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:09:35,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:35,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:09:35,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:35,861 INFO L87 Difference]: Start difference. First operand has 257 states, 205 states have (on average 1.5658536585365854) internal successors, (321), 213 states have internal predecessors, (321), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-21 08:09:36,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:36,556 INFO L93 Difference]: Finished difference Result 646 states and 985 transitions. [2022-07-21 08:09:36,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:09:36,559 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-07-21 08:09:36,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:36,574 INFO L225 Difference]: With dead ends: 646 [2022-07-21 08:09:36,574 INFO L226 Difference]: Without dead ends: 397 [2022-07-21 08:09:36,580 INFO L412 NwaCegarLoop]: 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 [2022-07-21 08:09:36,583 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 678 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:36,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1237 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 08:09:36,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-07-21 08:09:36,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 358. [2022-07-21 08:09:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 287 states have (on average 1.456445993031359) internal successors, (418), 294 states have internal predecessors, (418), 47 states have call successors, (47), 22 states have call predecessors, (47), 22 states have return successors, (48), 44 states have call predecessors, (48), 43 states have call successors, (48) [2022-07-21 08:09:36,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 513 transitions. [2022-07-21 08:09:36,656 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 513 transitions. Word has length 65 [2022-07-21 08:09:36,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:36,656 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 513 transitions. [2022-07-21 08:09:36,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-21 08:09:36,657 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 513 transitions. [2022-07-21 08:09:36,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 08:09:36,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:36,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:36,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 08:09:36,660 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:36,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:36,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1595275567, now seen corresponding path program 1 times [2022-07-21 08:09:36,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:36,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758991354] [2022-07-21 08:09:36,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:36,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:36,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:36,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:36,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:36,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:36,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:09:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:36,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 08:09:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:36,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 08:09:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:09:36,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:36,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758991354] [2022-07-21 08:09:36,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758991354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:36,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:36,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 08:09:36,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429283813] [2022-07-21 08:09:36,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:36,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 08:09:36,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:36,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 08:09:36,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:09:36,801 INFO L87 Difference]: Start difference. First operand 358 states and 513 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-21 08:09:38,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:38,192 INFO L93 Difference]: Finished difference Result 1391 states and 1973 transitions. [2022-07-21 08:09:38,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 08:09:38,194 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-07-21 08:09:38,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:38,199 INFO L225 Difference]: With dead ends: 1391 [2022-07-21 08:09:38,200 INFO L226 Difference]: Without dead ends: 1170 [2022-07-21 08:09:38,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-07-21 08:09:38,202 INFO L413 NwaCegarLoop]: 502 mSDtfsCounter, 2123 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2143 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 2224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:38,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2143 Valid, 1966 Invalid, 2224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-21 08:09:38,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2022-07-21 08:09:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1031. [2022-07-21 08:09:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 830 states have (on average 1.393975903614458) internal successors, (1157), 845 states have internal predecessors, (1157), 118 states have call successors, (118), 75 states have call predecessors, (118), 81 states have return successors, (128), 112 states have call predecessors, (128), 114 states have call successors, (128) [2022-07-21 08:09:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1403 transitions. [2022-07-21 08:09:38,262 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1403 transitions. Word has length 65 [2022-07-21 08:09:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:38,263 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1403 transitions. [2022-07-21 08:09:38,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-07-21 08:09:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1403 transitions. [2022-07-21 08:09:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-21 08:09:38,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:38,265 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:38,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 08:09:38,265 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:38,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:38,265 INFO L85 PathProgramCache]: Analyzing trace with hash -306777911, now seen corresponding path program 1 times [2022-07-21 08:09:38,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:38,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824415036] [2022-07-21 08:09:38,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:38,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:38,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 08:09:38,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 08:09:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:09:38,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:38,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824415036] [2022-07-21 08:09:38,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824415036] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:38,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:38,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:09:38,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342658987] [2022-07-21 08:09:38,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:38,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:09:38,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:38,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:09:38,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:09:38,369 INFO L87 Difference]: Start difference. First operand 1031 states and 1403 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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) [2022-07-21 08:09:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:38,919 INFO L93 Difference]: Finished difference Result 2057 states and 2797 transitions. [2022-07-21 08:09:38,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 08:09:38,924 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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 66 [2022-07-21 08:09:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:38,941 INFO L225 Difference]: With dead ends: 2057 [2022-07-21 08:09:38,941 INFO L226 Difference]: Without dead ends: 1169 [2022-07-21 08:09:38,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-21 08:09:38,944 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 395 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:38,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1430 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 08:09:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2022-07-21 08:09:38,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1061. [2022-07-21 08:09:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 854 states have (on average 1.379391100702576) internal successors, (1178), 869 states have internal predecessors, (1178), 118 states have call successors, (118), 75 states have call predecessors, (118), 87 states have return successors, (134), 118 states have call predecessors, (134), 114 states have call successors, (134) [2022-07-21 08:09:38,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1430 transitions. [2022-07-21 08:09:38,985 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1430 transitions. Word has length 66 [2022-07-21 08:09:38,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:38,985 INFO L495 AbstractCegarLoop]: Abstraction has 1061 states and 1430 transitions. [2022-07-21 08:09:38,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 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) [2022-07-21 08:09:38,985 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1430 transitions. [2022-07-21 08:09:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-21 08:09:38,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:38,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:38,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 08:09:38,987 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:38,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:38,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1336137209, now seen corresponding path program 1 times [2022-07-21 08:09:38,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:38,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217906331] [2022-07-21 08:09:38,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:38,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 08:09:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-21 08:09:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:09:39,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:39,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217906331] [2022-07-21 08:09:39,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217906331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:39,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:39,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 08:09:39,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337384919] [2022-07-21 08:09:39,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:39,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 08:09:39,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:39,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 08:09:39,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:09:39,082 INFO L87 Difference]: Start difference. First operand 1061 states and 1430 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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) [2022-07-21 08:09:40,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:40,391 INFO L93 Difference]: Finished difference Result 3399 states and 4617 transitions. [2022-07-21 08:09:40,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 08:09:40,391 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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 66 [2022-07-21 08:09:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:40,396 INFO L225 Difference]: With dead ends: 3399 [2022-07-21 08:09:40,396 INFO L226 Difference]: Without dead ends: 1304 [2022-07-21 08:09:40,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-07-21 08:09:40,400 INFO L413 NwaCegarLoop]: 486 mSDtfsCounter, 2189 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 604 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2209 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 604 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:40,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2209 Valid, 1989 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [604 Valid, 1568 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-21 08:09:40,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2022-07-21 08:09:40,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1149. [2022-07-21 08:09:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 907 states have (on average 1.3395810363836824) internal successors, (1215), 922 states have internal predecessors, (1215), 138 states have call successors, (138), 89 states have call predecessors, (138), 102 states have return successors, (155), 139 states have call predecessors, (155), 134 states have call successors, (155) [2022-07-21 08:09:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1508 transitions. [2022-07-21 08:09:40,443 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1508 transitions. Word has length 66 [2022-07-21 08:09:40,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:40,444 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1508 transitions. [2022-07-21 08:09:40,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 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) [2022-07-21 08:09:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1508 transitions. [2022-07-21 08:09:40,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 08:09:40,445 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:40,445 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:40,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 08:09:40,445 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:40,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:40,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1682176981, now seen corresponding path program 1 times [2022-07-21 08:09:40,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:40,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940103046] [2022-07-21 08:09:40,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:40,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:09:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:09:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:09:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:09:40,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:40,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940103046] [2022-07-21 08:09:40,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940103046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:40,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:40,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:09:40,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458503157] [2022-07-21 08:09:40,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:40,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:09:40,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:40,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:09:40,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:09:40,517 INFO L87 Difference]: Start difference. First operand 1149 states and 1508 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:09:41,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:41,062 INFO L93 Difference]: Finished difference Result 1459 states and 1979 transitions. [2022-07-21 08:09:41,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 08:09:41,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-21 08:09:41,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:41,067 INFO L225 Difference]: With dead ends: 1459 [2022-07-21 08:09:41,067 INFO L226 Difference]: Without dead ends: 1335 [2022-07-21 08:09:41,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:09:41,069 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 667 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:41,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 897 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 08:09:41,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-07-21 08:09:41,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1270. [2022-07-21 08:09:41,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 1010 states have (on average 1.3574257425742575) internal successors, (1371), 1026 states have internal predecessors, (1371), 149 states have call successors, (149), 95 states have call predecessors, (149), 109 states have return successors, (169), 150 states have call predecessors, (169), 145 states have call successors, (169) [2022-07-21 08:09:41,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1689 transitions. [2022-07-21 08:09:41,130 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1689 transitions. Word has length 69 [2022-07-21 08:09:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:41,130 INFO L495 AbstractCegarLoop]: Abstraction has 1270 states and 1689 transitions. [2022-07-21 08:09:41,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:09:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1689 transitions. [2022-07-21 08:09:41,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 08:09:41,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:41,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:41,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 08:09:41,132 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:41,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:41,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1579462617, now seen corresponding path program 1 times [2022-07-21 08:09:41,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:41,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750929354] [2022-07-21 08:09:41,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:41,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:09:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:09:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:09:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:09:41,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:41,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750929354] [2022-07-21 08:09:41,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750929354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:41,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:41,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:09:41,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444469914] [2022-07-21 08:09:41,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:41,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:09:41,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:41,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:09:41,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:09:41,192 INFO L87 Difference]: Start difference. First operand 1270 states and 1689 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:09:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:41,894 INFO L93 Difference]: Finished difference Result 1732 states and 2383 transitions. [2022-07-21 08:09:41,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:09:41,894 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-21 08:09:41,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:41,899 INFO L225 Difference]: With dead ends: 1732 [2022-07-21 08:09:41,899 INFO L226 Difference]: Without dead ends: 1487 [2022-07-21 08:09:41,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-07-21 08:09:41,901 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 684 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:41,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 1103 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 08:09:41,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2022-07-21 08:09:41,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1384. [2022-07-21 08:09:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1106 states have (on average 1.367992766726944) internal successors, (1513), 1123 states have internal predecessors, (1513), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-07-21 08:09:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1855 transitions. [2022-07-21 08:09:41,956 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1855 transitions. Word has length 69 [2022-07-21 08:09:41,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:41,956 INFO L495 AbstractCegarLoop]: Abstraction has 1384 states and 1855 transitions. [2022-07-21 08:09:41,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:09:41,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1855 transitions. [2022-07-21 08:09:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 08:09:41,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:41,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:41,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 08:09:41,958 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:41,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash -192677207, now seen corresponding path program 1 times [2022-07-21 08:09:41,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:41,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880710042] [2022-07-21 08:09:41,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:41,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:41,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:09:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:09:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:09:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:09:42,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:42,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880710042] [2022-07-21 08:09:42,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880710042] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:42,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:42,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:09:42,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491856496] [2022-07-21 08:09:42,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:42,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:09:42,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:42,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:09:42,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:09:42,008 INFO L87 Difference]: Start difference. First operand 1384 states and 1855 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:09:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:42,429 INFO L93 Difference]: Finished difference Result 1842 states and 2549 transitions. [2022-07-21 08:09:42,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 08:09:42,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-21 08:09:42,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:42,435 INFO L225 Difference]: With dead ends: 1842 [2022-07-21 08:09:42,435 INFO L226 Difference]: Without dead ends: 1483 [2022-07-21 08:09:42,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:09:42,437 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 662 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:42,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 753 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 08:09:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2022-07-21 08:09:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1384. [2022-07-21 08:09:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1106 states have (on average 1.3652802893309222) internal successors, (1510), 1123 states have internal predecessors, (1510), 160 states have call successors, (160), 101 states have call predecessors, (160), 116 states have return successors, (182), 162 states have call predecessors, (182), 156 states have call successors, (182) [2022-07-21 08:09:42,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1852 transitions. [2022-07-21 08:09:42,492 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1852 transitions. Word has length 69 [2022-07-21 08:09:42,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:42,493 INFO L495 AbstractCegarLoop]: Abstraction has 1384 states and 1852 transitions. [2022-07-21 08:09:42,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:09:42,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1852 transitions. [2022-07-21 08:09:42,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 08:09:42,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:42,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:42,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 08:09:42,498 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:42,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:42,499 INFO L85 PathProgramCache]: Analyzing trace with hash 251223467, now seen corresponding path program 1 times [2022-07-21 08:09:42,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:42,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162290966] [2022-07-21 08:09:42,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:42,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:09:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:09:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:09:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:42,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:09:42,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:42,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162290966] [2022-07-21 08:09:42,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162290966] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:42,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:42,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:09:42,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707577296] [2022-07-21 08:09:42,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:42,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:09:42,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:42,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:09:42,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:09:42,560 INFO L87 Difference]: Start difference. First operand 1384 states and 1852 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:09:43,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:43,275 INFO L93 Difference]: Finished difference Result 2178 states and 3027 transitions. [2022-07-21 08:09:43,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 08:09:43,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-21 08:09:43,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:43,281 INFO L225 Difference]: With dead ends: 2178 [2022-07-21 08:09:43,281 INFO L226 Difference]: Without dead ends: 1819 [2022-07-21 08:09:43,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-21 08:09:43,283 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 708 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:43,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 1343 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 08:09:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2022-07-21 08:09:43,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1593. [2022-07-21 08:09:43,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1281 states have (on average 1.3762685402029664) internal successors, (1763), 1300 states have internal predecessors, (1763), 180 states have call successors, (180), 113 states have call predecessors, (180), 130 states have return successors, (210), 184 states have call predecessors, (210), 176 states have call successors, (210) [2022-07-21 08:09:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2153 transitions. [2022-07-21 08:09:43,348 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2153 transitions. Word has length 69 [2022-07-21 08:09:43,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:43,349 INFO L495 AbstractCegarLoop]: Abstraction has 1593 states and 2153 transitions. [2022-07-21 08:09:43,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:09:43,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2153 transitions. [2022-07-21 08:09:43,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 08:09:43,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:43,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:43,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 08:09:43,351 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:43,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:43,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1789563497, now seen corresponding path program 1 times [2022-07-21 08:09:43,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:43,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787852994] [2022-07-21 08:09:43,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:43,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:09:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:09:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:09:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:09:43,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:43,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787852994] [2022-07-21 08:09:43,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787852994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:43,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:43,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:09:43,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090553473] [2022-07-21 08:09:43,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:43,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:09:43,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:43,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:09:43,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:09:43,402 INFO L87 Difference]: Start difference. First operand 1593 states and 2153 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:09:44,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:44,133 INFO L93 Difference]: Finished difference Result 2881 states and 4034 transitions. [2022-07-21 08:09:44,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 08:09:44,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-21 08:09:44,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:44,143 INFO L225 Difference]: With dead ends: 2881 [2022-07-21 08:09:44,143 INFO L226 Difference]: Without dead ends: 2313 [2022-07-21 08:09:44,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-07-21 08:09:44,147 INFO L413 NwaCegarLoop]: 433 mSDtfsCounter, 651 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:44,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 1355 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 08:09:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2022-07-21 08:09:44,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 2024. [2022-07-21 08:09:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 1646 states have (on average 1.3955042527339003) internal successors, (2297), 1669 states have internal predecessors, (2297), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-07-21 08:09:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2785 transitions. [2022-07-21 08:09:44,236 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2785 transitions. Word has length 69 [2022-07-21 08:09:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:44,236 INFO L495 AbstractCegarLoop]: Abstraction has 2024 states and 2785 transitions. [2022-07-21 08:09:44,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:09:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2785 transitions. [2022-07-21 08:09:44,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 08:09:44,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:44,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:44,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 08:09:44,238 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:44,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:44,239 INFO L85 PathProgramCache]: Analyzing trace with hash -239022613, now seen corresponding path program 1 times [2022-07-21 08:09:44,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:44,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883268879] [2022-07-21 08:09:44,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:44,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:09:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:09:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:09:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:09:44,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:44,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883268879] [2022-07-21 08:09:44,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883268879] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:44,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:44,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:09:44,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426049291] [2022-07-21 08:09:44,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:44,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:09:44,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:44,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:09:44,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:09:44,311 INFO L87 Difference]: Start difference. First operand 2024 states and 2785 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:09:44,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:44,921 INFO L93 Difference]: Finished difference Result 3560 states and 5064 transitions. [2022-07-21 08:09:44,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 08:09:44,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-21 08:09:44,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:44,931 INFO L225 Difference]: With dead ends: 3560 [2022-07-21 08:09:44,931 INFO L226 Difference]: Without dead ends: 2562 [2022-07-21 08:09:44,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-21 08:09:44,935 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 376 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:44,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1169 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 08:09:44,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2022-07-21 08:09:45,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2051. [2022-07-21 08:09:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2051 states, 1673 states have (on average 1.389121338912134) internal successors, (2324), 1696 states have internal predecessors, (2324), 218 states have call successors, (218), 137 states have call predecessors, (218), 158 states have return successors, (270), 226 states have call predecessors, (270), 214 states have call successors, (270) [2022-07-21 08:09:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 2812 transitions. [2022-07-21 08:09:45,041 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 2812 transitions. Word has length 69 [2022-07-21 08:09:45,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:45,041 INFO L495 AbstractCegarLoop]: Abstraction has 2051 states and 2812 transitions. [2022-07-21 08:09:45,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:09:45,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2812 transitions. [2022-07-21 08:09:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 08:09:45,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:45,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:45,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 08:09:45,043 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:45,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:45,044 INFO L85 PathProgramCache]: Analyzing trace with hash 9123881, now seen corresponding path program 1 times [2022-07-21 08:09:45,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:45,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401494205] [2022-07-21 08:09:45,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:45,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:09:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:09:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:09:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 08:09:45,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:45,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401494205] [2022-07-21 08:09:45,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401494205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:45,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:45,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:09:45,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111908103] [2022-07-21 08:09:45,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:45,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:09:45,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:45,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:09:45,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:09:45,143 INFO L87 Difference]: Start difference. First operand 2051 states and 2812 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:09:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:46,262 INFO L93 Difference]: Finished difference Result 5545 states and 8068 transitions. [2022-07-21 08:09:46,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 08:09:46,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2022-07-21 08:09:46,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:46,278 INFO L225 Difference]: With dead ends: 5545 [2022-07-21 08:09:46,278 INFO L226 Difference]: Without dead ends: 4520 [2022-07-21 08:09:46,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-07-21 08:09:46,283 INFO L413 NwaCegarLoop]: 500 mSDtfsCounter, 1435 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:46,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1459 Valid, 1147 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 08:09:46,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2022-07-21 08:09:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 3969. [2022-07-21 08:09:46,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3969 states, 3269 states have (on average 1.4028754970939126) internal successors, (4586), 3323 states have internal predecessors, (4586), 410 states have call successors, (410), 251 states have call predecessors, (410), 288 states have return successors, (579), 403 states have call predecessors, (579), 406 states have call successors, (579) [2022-07-21 08:09:46,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3969 states to 3969 states and 5575 transitions. [2022-07-21 08:09:46,486 INFO L78 Accepts]: Start accepts. Automaton has 3969 states and 5575 transitions. Word has length 69 [2022-07-21 08:09:46,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:46,486 INFO L495 AbstractCegarLoop]: Abstraction has 3969 states and 5575 transitions. [2022-07-21 08:09:46,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-21 08:09:46,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3969 states and 5575 transitions. [2022-07-21 08:09:46,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-21 08:09:46,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:46,491 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:46,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 08:09:46,491 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:46,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:46,492 INFO L85 PathProgramCache]: Analyzing trace with hash -411543486, now seen corresponding path program 1 times [2022-07-21 08:09:46,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:46,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223307347] [2022-07-21 08:09:46,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:46,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 08:09:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 08:09:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 08:09:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 08:09:46,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:46,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223307347] [2022-07-21 08:09:46,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223307347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:46,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:46,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:09:46,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499188216] [2022-07-21 08:09:46,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:46,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:09:46,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:46,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:09:46,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:09:46,578 INFO L87 Difference]: Start difference. First operand 3969 states and 5575 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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) [2022-07-21 08:09:47,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:47,176 INFO L93 Difference]: Finished difference Result 5146 states and 7126 transitions. [2022-07-21 08:09:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 08:09:47,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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 91 [2022-07-21 08:09:47,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:47,192 INFO L225 Difference]: With dead ends: 5146 [2022-07-21 08:09:47,192 INFO L226 Difference]: Without dead ends: 4140 [2022-07-21 08:09:47,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-07-21 08:09:47,197 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 258 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:47,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1534 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 08:09:47,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2022-07-21 08:09:47,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 4009. [2022-07-21 08:09:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4009 states, 3301 states have (on average 1.3980611935777036) internal successors, (4615), 3355 states have internal predecessors, (4615), 410 states have call successors, (410), 251 states have call predecessors, (410), 296 states have return successors, (587), 411 states have call predecessors, (587), 406 states have call successors, (587) [2022-07-21 08:09:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 5612 transitions. [2022-07-21 08:09:47,398 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 5612 transitions. Word has length 91 [2022-07-21 08:09:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:47,398 INFO L495 AbstractCegarLoop]: Abstraction has 4009 states and 5612 transitions. [2022-07-21 08:09:47,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 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) [2022-07-21 08:09:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 5612 transitions. [2022-07-21 08:09:47,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-21 08:09:47,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:47,402 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:47,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 08:09:47,402 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:47,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:47,403 INFO L85 PathProgramCache]: Analyzing trace with hash 32357188, now seen corresponding path program 1 times [2022-07-21 08:09:47,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:47,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216505008] [2022-07-21 08:09:47,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:47,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:47,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:47,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:47,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:47,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:47,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:47,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 08:09:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:47,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 08:09:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:47,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 08:09:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 08:09:47,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:47,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216505008] [2022-07-21 08:09:47,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216505008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:47,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:47,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 08:09:47,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638771553] [2022-07-21 08:09:47,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:47,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 08:09:47,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:47,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 08:09:47,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:47,492 INFO L87 Difference]: Start difference. First operand 4009 states and 5612 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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) [2022-07-21 08:09:48,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:48,270 INFO L93 Difference]: Finished difference Result 6047 states and 8217 transitions. [2022-07-21 08:09:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 08:09:48,271 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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 91 [2022-07-21 08:09:48,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:48,295 INFO L225 Difference]: With dead ends: 6047 [2022-07-21 08:09:48,296 INFO L226 Difference]: Without dead ends: 5002 [2022-07-21 08:09:48,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-07-21 08:09:48,301 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 687 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:48,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1302 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 08:09:48,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5002 states. [2022-07-21 08:09:48,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5002 to 4686. [2022-07-21 08:09:48,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4686 states, 3830 states have (on average 1.3783289817232376) internal successors, (5279), 3897 states have internal predecessors, (5279), 486 states have call successors, (486), 304 states have call predecessors, (486), 368 states have return successors, (700), 494 states have call predecessors, (700), 482 states have call successors, (700) [2022-07-21 08:09:48,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4686 states to 4686 states and 6465 transitions. [2022-07-21 08:09:48,523 INFO L78 Accepts]: Start accepts. Automaton has 4686 states and 6465 transitions. Word has length 91 [2022-07-21 08:09:48,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:48,523 INFO L495 AbstractCegarLoop]: Abstraction has 4686 states and 6465 transitions. [2022-07-21 08:09:48,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 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) [2022-07-21 08:09:48,524 INFO L276 IsEmpty]: Start isEmpty. Operand 4686 states and 6465 transitions. [2022-07-21 08:09:48,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-21 08:09:48,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:48,527 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:48,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 08:09:48,528 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:48,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:48,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1971519234, now seen corresponding path program 1 times [2022-07-21 08:09:48,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:48,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063277679] [2022-07-21 08:09:48,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:48,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:48,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:48,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:48,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:48,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:48,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:48,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 08:09:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:48,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 08:09:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:48,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 08:09:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 08:09:48,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:48,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063277679] [2022-07-21 08:09:48,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063277679] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:48,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:48,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:09:48,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776467602] [2022-07-21 08:09:48,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:48,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:09:48,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:48,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:09:48,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:09:48,594 INFO L87 Difference]: Start difference. First operand 4686 states and 6465 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-21 08:09:49,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:49,097 INFO L93 Difference]: Finished difference Result 8345 states and 11247 transitions. [2022-07-21 08:09:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 08:09:49,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-07-21 08:09:49,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:49,118 INFO L225 Difference]: With dead ends: 8345 [2022-07-21 08:09:49,119 INFO L226 Difference]: Without dead ends: 6625 [2022-07-21 08:09:49,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-07-21 08:09:49,125 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 757 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:49,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 889 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 08:09:49,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2022-07-21 08:09:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 6405. [2022-07-21 08:09:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6405 states, 5168 states have (on average 1.3432662538699691) internal successors, (6942), 5271 states have internal predecessors, (6942), 679 states have call successors, (679), 438 states have call predecessors, (679), 556 states have return successors, (1040), 707 states have call predecessors, (1040), 675 states have call successors, (1040) [2022-07-21 08:09:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 8661 transitions. [2022-07-21 08:09:49,415 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 8661 transitions. Word has length 91 [2022-07-21 08:09:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:49,416 INFO L495 AbstractCegarLoop]: Abstraction has 6405 states and 8661 transitions. [2022-07-21 08:09:49,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-21 08:09:49,417 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 8661 transitions. [2022-07-21 08:09:49,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-21 08:09:49,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:49,421 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:49,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 08:09:49,421 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:49,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:49,421 INFO L85 PathProgramCache]: Analyzing trace with hash 913681156, now seen corresponding path program 1 times [2022-07-21 08:09:49,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:49,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471722649] [2022-07-21 08:09:49,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:49,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:49,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:49,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:49,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:49,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:49,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:49,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 08:09:49,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:49,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 08:09:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:49,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-21 08:09:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 08:09:49,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:49,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471722649] [2022-07-21 08:09:49,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471722649] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:49,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:49,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 08:09:49,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108385064] [2022-07-21 08:09:49,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:49,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 08:09:49,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:49,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 08:09:49,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:09:49,467 INFO L87 Difference]: Start difference. First operand 6405 states and 8661 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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) [2022-07-21 08:09:49,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:49,925 INFO L93 Difference]: Finished difference Result 8243 states and 10964 transitions. [2022-07-21 08:09:49,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 08:09:49,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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 91 [2022-07-21 08:09:49,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:49,943 INFO L225 Difference]: With dead ends: 8243 [2022-07-21 08:09:49,943 INFO L226 Difference]: Without dead ends: 4804 [2022-07-21 08:09:49,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:09:49,952 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 494 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:49,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 734 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 08:09:49,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4804 states. [2022-07-21 08:09:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4804 to 4686. [2022-07-21 08:09:50,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4686 states, 3830 states have (on average 1.3671018276762401) internal successors, (5236), 3897 states have internal predecessors, (5236), 486 states have call successors, (486), 304 states have call predecessors, (486), 368 states have return successors, (700), 494 states have call predecessors, (700), 482 states have call successors, (700) [2022-07-21 08:09:50,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4686 states to 4686 states and 6422 transitions. [2022-07-21 08:09:50,166 INFO L78 Accepts]: Start accepts. Automaton has 4686 states and 6422 transitions. Word has length 91 [2022-07-21 08:09:50,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:50,167 INFO L495 AbstractCegarLoop]: Abstraction has 4686 states and 6422 transitions. [2022-07-21 08:09:50,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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) [2022-07-21 08:09:50,167 INFO L276 IsEmpty]: Start isEmpty. Operand 4686 states and 6422 transitions. [2022-07-21 08:09:50,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-21 08:09:50,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:50,170 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:50,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 08:09:50,170 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:50,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:50,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1870290611, now seen corresponding path program 1 times [2022-07-21 08:09:50,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:50,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602360885] [2022-07-21 08:09:50,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:50,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:50,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:50,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:50,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:50,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:50,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:50,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:50,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 08:09:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:50,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 08:09:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:50,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 08:09:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 08:09:50,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:50,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602360885] [2022-07-21 08:09:50,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602360885] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:50,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:09:50,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 08:09:50,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613773894] [2022-07-21 08:09:50,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:50,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 08:09:50,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:50,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 08:09:50,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:09:50,238 INFO L87 Difference]: Start difference. First operand 4686 states and 6422 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-21 08:09:51,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:51,225 INFO L93 Difference]: Finished difference Result 7512 states and 10024 transitions. [2022-07-21 08:09:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-21 08:09:51,225 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-07-21 08:09:51,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:51,238 INFO L225 Difference]: With dead ends: 7512 [2022-07-21 08:09:51,238 INFO L226 Difference]: Without dead ends: 5485 [2022-07-21 08:09:51,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-07-21 08:09:51,243 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 1774 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 1466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:51,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1807 Valid, 1181 Invalid, 1466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 08:09:51,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5485 states. [2022-07-21 08:09:51,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5485 to 5308. [2022-07-21 08:09:51,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5308 states, 4296 states have (on average 1.3424115456238361) internal successors, (5767), 4371 states have internal predecessors, (5767), 564 states have call successors, (564), 352 states have call predecessors, (564), 446 states have return successors, (833), 594 states have call predecessors, (833), 560 states have call successors, (833) [2022-07-21 08:09:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5308 states to 5308 states and 7164 transitions. [2022-07-21 08:09:51,457 INFO L78 Accepts]: Start accepts. Automaton has 5308 states and 7164 transitions. Word has length 92 [2022-07-21 08:09:51,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:51,458 INFO L495 AbstractCegarLoop]: Abstraction has 5308 states and 7164 transitions. [2022-07-21 08:09:51,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-21 08:09:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand 5308 states and 7164 transitions. [2022-07-21 08:09:51,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-21 08:09:51,462 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:51,462 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:51,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 08:09:51,463 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:51,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:51,463 INFO L85 PathProgramCache]: Analyzing trace with hash 56705439, now seen corresponding path program 1 times [2022-07-21 08:09:51,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:51,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232687947] [2022-07-21 08:09:51,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:51,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:51,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:51,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:51,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:09:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:51,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:09:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:51,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:09:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:51,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 08:09:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:51,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:51,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 08:09:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-21 08:09:51,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:51,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232687947] [2022-07-21 08:09:51,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232687947] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:09:51,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367066839] [2022-07-21 08:09:51,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:51,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:51,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:09:51,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:09:51,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 08:09:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:51,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:09:51,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:09:51,699 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 08:09:51,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:09:51,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367066839] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:51,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:09:51,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:09:51,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959103473] [2022-07-21 08:09:51,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:51,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:09:51,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:51,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:09:51,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:51,701 INFO L87 Difference]: Start difference. First operand 5308 states and 7164 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:09:51,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:51,982 INFO L93 Difference]: Finished difference Result 11026 states and 15472 transitions. [2022-07-21 08:09:51,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:09:51,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 111 [2022-07-21 08:09:51,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:51,997 INFO L225 Difference]: With dead ends: 11026 [2022-07-21 08:09:51,997 INFO L226 Difference]: Without dead ends: 5838 [2022-07-21 08:09:52,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:52,009 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 153 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 829 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:52,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 829 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:09:52,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5838 states. [2022-07-21 08:09:52,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5838 to 5838. [2022-07-21 08:09:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5838 states, 4743 states have (on average 1.3487244360109636) internal successors, (6397), 4822 states have internal predecessors, (6397), 613 states have call successors, (613), 382 states have call predecessors, (613), 480 states have return successors, (911), 643 states have call predecessors, (911), 609 states have call successors, (911) [2022-07-21 08:09:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5838 states to 5838 states and 7921 transitions. [2022-07-21 08:09:52,323 INFO L78 Accepts]: Start accepts. Automaton has 5838 states and 7921 transitions. Word has length 111 [2022-07-21 08:09:52,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:52,324 INFO L495 AbstractCegarLoop]: Abstraction has 5838 states and 7921 transitions. [2022-07-21 08:09:52,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:09:52,324 INFO L276 IsEmpty]: Start isEmpty. Operand 5838 states and 7921 transitions. [2022-07-21 08:09:52,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-21 08:09:52,331 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:52,331 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:52,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 08:09:52,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-21 08:09:52,548 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:52,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:52,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1296496829, now seen corresponding path program 1 times [2022-07-21 08:09:52,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:52,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180394958] [2022-07-21 08:09:52,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:52,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:52,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:52,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:52,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:09:52,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:52,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:09:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:52,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:09:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:52,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 08:09:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:52,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:52,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:52,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 08:09:52,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:52,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:52,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 08:09:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:52,620 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-21 08:09:52,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:52,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180394958] [2022-07-21 08:09:52,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180394958] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:09:52,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813247041] [2022-07-21 08:09:52,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:52,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:52,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:09:52,622 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:09:52,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 08:09:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:52,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:09:52,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:09:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 08:09:52,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:09:52,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813247041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:52,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:09:52,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-21 08:09:52,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668034050] [2022-07-21 08:09:52,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:52,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:09:52,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:52,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:09:52,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:52,806 INFO L87 Difference]: Start difference. First operand 5838 states and 7921 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 08:09:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:53,170 INFO L93 Difference]: Finished difference Result 12594 states and 17806 transitions. [2022-07-21 08:09:53,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:09:53,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 143 [2022-07-21 08:09:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:53,193 INFO L225 Difference]: With dead ends: 12594 [2022-07-21 08:09:53,193 INFO L226 Difference]: Without dead ends: 9121 [2022-07-21 08:09:53,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:53,203 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 252 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:53,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 518 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:09:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9121 states. [2022-07-21 08:09:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9121 to 9051. [2022-07-21 08:09:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9051 states, 7446 states have (on average 1.3759065269943593) internal successors, (10245), 7568 states have internal predecessors, (10245), 905 states have call successors, (905), 572 states have call predecessors, (905), 698 states have return successors, (1355), 920 states have call predecessors, (1355), 901 states have call successors, (1355) [2022-07-21 08:09:53,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9051 states to 9051 states and 12505 transitions. [2022-07-21 08:09:53,569 INFO L78 Accepts]: Start accepts. Automaton has 9051 states and 12505 transitions. Word has length 143 [2022-07-21 08:09:53,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:53,571 INFO L495 AbstractCegarLoop]: Abstraction has 9051 states and 12505 transitions. [2022-07-21 08:09:53,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 08:09:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 9051 states and 12505 transitions. [2022-07-21 08:09:53,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-21 08:09:53,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:53,582 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:53,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 08:09:53,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-21 08:09:53,795 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:53,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:53,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2080420097, now seen corresponding path program 1 times [2022-07-21 08:09:53,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:53,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659886667] [2022-07-21 08:09:53,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:53,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:53,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:53,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:53,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:53,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:09:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:53,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:09:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:53,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:09:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:53,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 08:09:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:53,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:53,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-21 08:09:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:53,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:53,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 08:09:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:53,869 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-21 08:09:53,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:53,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659886667] [2022-07-21 08:09:53,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659886667] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:09:53,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847287228] [2022-07-21 08:09:53,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:53,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:53,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:09:53,871 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:09:53,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-21 08:09:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:54,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:09:54,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:09:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 08:09:54,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:09:54,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847287228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:54,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:09:54,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-21 08:09:54,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579875715] [2022-07-21 08:09:54,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:54,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:09:54,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:54,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:09:54,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:54,085 INFO L87 Difference]: Start difference. First operand 9051 states and 12505 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 08:09:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:54,460 INFO L93 Difference]: Finished difference Result 16387 states and 23265 transitions. [2022-07-21 08:09:54,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:09:54,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 143 [2022-07-21 08:09:54,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:54,496 INFO L225 Difference]: With dead ends: 16387 [2022-07-21 08:09:54,496 INFO L226 Difference]: Without dead ends: 12177 [2022-07-21 08:09:54,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:54,513 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 253 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:54,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 538 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:09:54,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2022-07-21 08:09:54,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 12077. [2022-07-21 08:09:54,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12077 states, 9997 states have (on average 1.3899169750925278) internal successors, (13895), 10153 states have internal predecessors, (13895), 1181 states have call successors, (1181), 747 states have call predecessors, (1181), 897 states have return successors, (1750), 1186 states have call predecessors, (1750), 1177 states have call successors, (1750) [2022-07-21 08:09:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12077 states to 12077 states and 16826 transitions. [2022-07-21 08:09:55,007 INFO L78 Accepts]: Start accepts. Automaton has 12077 states and 16826 transitions. Word has length 143 [2022-07-21 08:09:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:55,007 INFO L495 AbstractCegarLoop]: Abstraction has 12077 states and 16826 transitions. [2022-07-21 08:09:55,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 08:09:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 12077 states and 16826 transitions. [2022-07-21 08:09:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-21 08:09:55,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:55,023 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:55,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-21 08:09:55,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:55,240 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:55,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:55,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1194272178, now seen corresponding path program 1 times [2022-07-21 08:09:55,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:55,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759688461] [2022-07-21 08:09:55,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:55,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:09:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:09:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 08:09:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 08:09:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 08:09:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 08:09:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 08:09:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 08:09:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:09:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:09:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 08:09:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 08:09:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 08:09:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 08:09:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-21 08:09:55,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:55,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759688461] [2022-07-21 08:09:55,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759688461] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:09:55,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128654541] [2022-07-21 08:09:55,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:55,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:55,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:09:55,328 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:09:55,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 08:09:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:55,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:09:55,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:09:55,496 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-21 08:09:55,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:09:55,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128654541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:55,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:09:55,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-21 08:09:55,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4576728] [2022-07-21 08:09:55,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:55,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:09:55,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:55,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:09:55,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:09:55,499 INFO L87 Difference]: Start difference. First operand 12077 states and 16826 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 08:09:56,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:56,121 INFO L93 Difference]: Finished difference Result 16402 states and 22141 transitions. [2022-07-21 08:09:56,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:09:56,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2022-07-21 08:09:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:56,164 INFO L225 Difference]: With dead ends: 16402 [2022-07-21 08:09:56,164 INFO L226 Difference]: Without dead ends: 14214 [2022-07-21 08:09:56,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:09:56,178 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 61 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:56,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 671 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:09:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14214 states. [2022-07-21 08:09:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14214 to 14169. [2022-07-21 08:09:56,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14169 states, 11622 states have (on average 1.3631905007743934) internal successors, (15843), 11807 states have internal predecessors, (15843), 1415 states have call successors, (1415), 929 states have call predecessors, (1415), 1130 states have return successors, (2057), 1442 states have call predecessors, (2057), 1411 states have call successors, (2057) [2022-07-21 08:09:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14169 states to 14169 states and 19315 transitions. [2022-07-21 08:09:56,853 INFO L78 Accepts]: Start accepts. Automaton has 14169 states and 19315 transitions. Word has length 163 [2022-07-21 08:09:56,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:56,853 INFO L495 AbstractCegarLoop]: Abstraction has 14169 states and 19315 transitions. [2022-07-21 08:09:56,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 08:09:56,854 INFO L276 IsEmpty]: Start isEmpty. Operand 14169 states and 19315 transitions. [2022-07-21 08:09:56,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-21 08:09:56,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:56,869 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:56,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 08:09:57,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:57,083 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:57,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:57,084 INFO L85 PathProgramCache]: Analyzing trace with hash 746982758, now seen corresponding path program 1 times [2022-07-21 08:09:57,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:57,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538859242] [2022-07-21 08:09:57,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:57,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:57,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:57,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:57,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:09:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:57,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:09:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:57,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:09:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:57,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 08:09:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:57,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 08:09:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:57,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:57,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 08:09:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:57,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:57,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 08:09:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-21 08:09:57,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:57,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538859242] [2022-07-21 08:09:57,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538859242] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:09:57,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397407287] [2022-07-21 08:09:57,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:57,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:57,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:09:57,154 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:09:57,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 08:09:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:57,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:09:57,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:09:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-21 08:09:57,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:09:57,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397407287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:57,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:09:57,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:09:57,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155401283] [2022-07-21 08:09:57,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:57,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:09:57,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:57,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:09:57,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:57,308 INFO L87 Difference]: Start difference. First operand 14169 states and 19315 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 08:09:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:57,797 INFO L93 Difference]: Finished difference Result 22989 states and 31923 transitions. [2022-07-21 08:09:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:09:57,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 160 [2022-07-21 08:09:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:57,835 INFO L225 Difference]: With dead ends: 22989 [2022-07-21 08:09:57,836 INFO L226 Difference]: Without dead ends: 13278 [2022-07-21 08:09:57,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:57,857 INFO L413 NwaCegarLoop]: 335 mSDtfsCounter, 272 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:57,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 369 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:09:57,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13278 states. [2022-07-21 08:09:58,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13278 to 13278. [2022-07-21 08:09:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13278 states, 10936 states have (on average 1.3204096561814191) internal successors, (14440), 11085 states have internal predecessors, (14440), 1263 states have call successors, (1263), 892 states have call predecessors, (1263), 1077 states have return successors, (1782), 1310 states have call predecessors, (1782), 1259 states have call successors, (1782) [2022-07-21 08:09:58,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13278 states to 13278 states and 17485 transitions. [2022-07-21 08:09:58,479 INFO L78 Accepts]: Start accepts. Automaton has 13278 states and 17485 transitions. Word has length 160 [2022-07-21 08:09:58,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:09:58,479 INFO L495 AbstractCegarLoop]: Abstraction has 13278 states and 17485 transitions. [2022-07-21 08:09:58,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 08:09:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 13278 states and 17485 transitions. [2022-07-21 08:09:58,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-21 08:09:58,492 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:09:58,492 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:09:58,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 08:09:58,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:58,707 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:09:58,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:09:58,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1605594576, now seen corresponding path program 1 times [2022-07-21 08:09:58,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:09:58,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843223868] [2022-07-21 08:09:58,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:58,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:09:58,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:58,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:09:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:58,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:09:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:58,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:09:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:58,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:09:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:58,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:09:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:58,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 08:09:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:58,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 08:09:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:58,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:58,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 08:09:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:58,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:09:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:58,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 08:09:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-21 08:09:58,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:09:58,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843223868] [2022-07-21 08:09:58,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843223868] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:09:58,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220176068] [2022-07-21 08:09:58,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:09:58,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:09:58,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:09:58,779 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:09:58,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 08:09:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:09:58,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 08:09:58,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:09:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-21 08:09:58,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:09:58,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220176068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:09:58,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:09:58,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:09:58,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825580571] [2022-07-21 08:09:58,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:09:58,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:09:58,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:09:58,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:09:58,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:58,881 INFO L87 Difference]: Start difference. First operand 13278 states and 17485 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 08:09:59,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:09:59,537 INFO L93 Difference]: Finished difference Result 22874 states and 30536 transitions. [2022-07-21 08:09:59,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:09:59,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 160 [2022-07-21 08:09:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:09:59,570 INFO L225 Difference]: With dead ends: 22874 [2022-07-21 08:09:59,570 INFO L226 Difference]: Without dead ends: 14054 [2022-07-21 08:09:59,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:09:59,585 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 299 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:09:59,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 527 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:09:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14054 states. [2022-07-21 08:10:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14054 to 13909. [2022-07-21 08:10:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13909 states, 11526 states have (on average 1.2980218636127017) internal successors, (14961), 11670 states have internal predecessors, (14961), 1262 states have call successors, (1262), 931 states have call predecessors, (1262), 1119 states have return successors, (1767), 1317 states have call predecessors, (1767), 1258 states have call successors, (1767) [2022-07-21 08:10:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13909 states to 13909 states and 17990 transitions. [2022-07-21 08:10:00,203 INFO L78 Accepts]: Start accepts. Automaton has 13909 states and 17990 transitions. Word has length 160 [2022-07-21 08:10:00,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:10:00,203 INFO L495 AbstractCegarLoop]: Abstraction has 13909 states and 17990 transitions. [2022-07-21 08:10:00,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 08:10:00,204 INFO L276 IsEmpty]: Start isEmpty. Operand 13909 states and 17990 transitions. [2022-07-21 08:10:00,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-21 08:10:00,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:10:00,215 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:10:00,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 08:10:00,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:00,427 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:10:00,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:10:00,428 INFO L85 PathProgramCache]: Analyzing trace with hash 522982663, now seen corresponding path program 1 times [2022-07-21 08:10:00,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:10:00,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986050671] [2022-07-21 08:10:00,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:00,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:10:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:00,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:10:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:00,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:10:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:00,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:10:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:00,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:10:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:00,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:10:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:00,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 08:10:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:00,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:00,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 08:10:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:00,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 08:10:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:00,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:00,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 08:10:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-21 08:10:00,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:10:00,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986050671] [2022-07-21 08:10:00,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986050671] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:10:00,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47642694] [2022-07-21 08:10:00,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:00,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:00,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:10:00,494 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:10:00,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 08:10:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:00,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:10:00,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:10:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 08:10:00,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:10:00,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47642694] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:10:00,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:10:00,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:10:00,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505600256] [2022-07-21 08:10:00,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:10:00,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:10:00,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:10:00,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:10:00,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:10:00,604 INFO L87 Difference]: Start difference. First operand 13909 states and 17990 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 08:10:01,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:10:01,752 INFO L93 Difference]: Finished difference Result 31048 states and 41157 transitions. [2022-07-21 08:10:01,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:10:01,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 161 [2022-07-21 08:10:01,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:10:01,822 INFO L225 Difference]: With dead ends: 31048 [2022-07-21 08:10:01,822 INFO L226 Difference]: Without dead ends: 21597 [2022-07-21 08:10:01,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:10:01,848 INFO L413 NwaCegarLoop]: 488 mSDtfsCounter, 152 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:10:01,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 821 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:10:01,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21597 states. [2022-07-21 08:10:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21597 to 21593. [2022-07-21 08:10:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21593 states, 18019 states have (on average 1.3083411954048505) internal successors, (23575), 18243 states have internal predecessors, (23575), 1917 states have call successors, (1917), 1400 states have call predecessors, (1917), 1655 states have return successors, (2930), 1967 states have call predecessors, (2930), 1913 states have call successors, (2930) [2022-07-21 08:10:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21593 states to 21593 states and 28422 transitions. [2022-07-21 08:10:03,029 INFO L78 Accepts]: Start accepts. Automaton has 21593 states and 28422 transitions. Word has length 161 [2022-07-21 08:10:03,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:10:03,030 INFO L495 AbstractCegarLoop]: Abstraction has 21593 states and 28422 transitions. [2022-07-21 08:10:03,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 08:10:03,033 INFO L276 IsEmpty]: Start isEmpty. Operand 21593 states and 28422 transitions. [2022-07-21 08:10:03,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-21 08:10:03,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:10:03,052 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:10:03,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 08:10:03,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:03,253 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:10:03,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:10:03,253 INFO L85 PathProgramCache]: Analyzing trace with hash 675676757, now seen corresponding path program 1 times [2022-07-21 08:10:03,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:10:03,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104557818] [2022-07-21 08:10:03,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:03,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:10:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:03,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:10:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:03,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:10:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:03,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:10:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:03,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:10:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:03,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:10:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:03,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 08:10:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:03,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 08:10:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:03,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:03,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 08:10:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:03,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:03,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 08:10:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:03,325 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-21 08:10:03,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:10:03,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104557818] [2022-07-21 08:10:03,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104557818] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:10:03,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747549486] [2022-07-21 08:10:03,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:03,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:03,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:10:03,328 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:10:03,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-21 08:10:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:03,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 08:10:03,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:10:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-21 08:10:03,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:10:03,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747549486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:10:03,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:10:03,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:10:03,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4097281] [2022-07-21 08:10:03,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:10:03,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:10:03,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:10:03,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:10:03,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:10:03,446 INFO L87 Difference]: Start difference. First operand 21593 states and 28422 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 08:10:04,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:10:04,953 INFO L93 Difference]: Finished difference Result 55172 states and 74382 transitions. [2022-07-21 08:10:04,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:10:04,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 161 [2022-07-21 08:10:04,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:10:05,057 INFO L225 Difference]: With dead ends: 55172 [2022-07-21 08:10:05,058 INFO L226 Difference]: Without dead ends: 38041 [2022-07-21 08:10:05,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:10:05,090 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 298 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:10:05,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 553 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:10:05,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38041 states. [2022-07-21 08:10:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38041 to 37835. [2022-07-21 08:10:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37835 states, 31807 states have (on average 1.3086741912157702) internal successors, (41625), 32191 states have internal predecessors, (41625), 3247 states have call successors, (3247), 2396 states have call predecessors, (3247), 2779 states have return successors, (5969), 3281 states have call predecessors, (5969), 3243 states have call successors, (5969) [2022-07-21 08:10:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37835 states to 37835 states and 50841 transitions. [2022-07-21 08:10:06,950 INFO L78 Accepts]: Start accepts. Automaton has 37835 states and 50841 transitions. Word has length 161 [2022-07-21 08:10:06,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:10:06,950 INFO L495 AbstractCegarLoop]: Abstraction has 37835 states and 50841 transitions. [2022-07-21 08:10:06,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-21 08:10:06,950 INFO L276 IsEmpty]: Start isEmpty. Operand 37835 states and 50841 transitions. [2022-07-21 08:10:06,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-21 08:10:06,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:10:06,980 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:10:06,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-21 08:10:07,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-21 08:10:07,181 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:10:07,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:10:07,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1567842387, now seen corresponding path program 1 times [2022-07-21 08:10:07,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:10:07,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718385937] [2022-07-21 08:10:07,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:07,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:10:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:07,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:10:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:07,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:10:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:07,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:10:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:07,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:10:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:07,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:10:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:07,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 08:10:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:07,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 08:10:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:07,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:07,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:07,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 08:10:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:07,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:07,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-21 08:10:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:07,227 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-21 08:10:07,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:10:07,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718385937] [2022-07-21 08:10:07,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718385937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:10:07,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:10:07,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 08:10:07,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391815759] [2022-07-21 08:10:07,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:10:07,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 08:10:07,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:10:07,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 08:10:07,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 08:10:07,229 INFO L87 Difference]: Start difference. First operand 37835 states and 50841 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-21 08:10:09,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:10:09,203 INFO L93 Difference]: Finished difference Result 67330 states and 90844 transitions. [2022-07-21 08:10:09,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 08:10:09,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 161 [2022-07-21 08:10:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:10:09,294 INFO L225 Difference]: With dead ends: 67330 [2022-07-21 08:10:09,295 INFO L226 Difference]: Without dead ends: 33955 [2022-07-21 08:10:09,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:10:09,357 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 433 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 08:10:09,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 663 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 08:10:09,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33955 states. [2022-07-21 08:10:11,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33955 to 31775. [2022-07-21 08:10:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31775 states, 26625 states have (on average 1.307680751173709) internal successors, (34817), 27174 states have internal predecessors, (34817), 2569 states have call successors, (2569), 1888 states have call predecessors, (2569), 2579 states have return successors, (5056), 2730 states have call predecessors, (5056), 2565 states have call successors, (5056) [2022-07-21 08:10:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31775 states to 31775 states and 42442 transitions. [2022-07-21 08:10:11,401 INFO L78 Accepts]: Start accepts. Automaton has 31775 states and 42442 transitions. Word has length 161 [2022-07-21 08:10:11,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:10:11,401 INFO L495 AbstractCegarLoop]: Abstraction has 31775 states and 42442 transitions. [2022-07-21 08:10:11,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-21 08:10:11,402 INFO L276 IsEmpty]: Start isEmpty. Operand 31775 states and 42442 transitions. [2022-07-21 08:10:11,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-21 08:10:11,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:10:11,428 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:10:11,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-21 08:10:11,428 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:10:11,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:10:11,428 INFO L85 PathProgramCache]: Analyzing trace with hash -423691555, now seen corresponding path program 1 times [2022-07-21 08:10:11,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:10:11,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831435341] [2022-07-21 08:10:11,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:11,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:10:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:11,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:10:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:11,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:10:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:11,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:10:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:11,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:10:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:11,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:10:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:11,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:10:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:11,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 08:10:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:11,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:11,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 08:10:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:11,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:11,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 08:10:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:11,494 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-21 08:10:11,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:10:11,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831435341] [2022-07-21 08:10:11,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831435341] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:10:11,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112993184] [2022-07-21 08:10:11,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:11,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:11,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:10:11,496 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:10:11,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-21 08:10:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:11,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 08:10:11,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:10:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 08:10:11,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:10:11,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112993184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:10:11,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:10:11,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:10:11,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351675049] [2022-07-21 08:10:11,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:10:11,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:10:11,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:10:11,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:10:11,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:10:11,636 INFO L87 Difference]: Start difference. First operand 31775 states and 42442 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 08:10:13,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:10:13,048 INFO L93 Difference]: Finished difference Result 50520 states and 69980 transitions. [2022-07-21 08:10:13,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:10:13,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 163 [2022-07-21 08:10:13,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:10:13,129 INFO L225 Difference]: With dead ends: 50520 [2022-07-21 08:10:13,129 INFO L226 Difference]: Without dead ends: 31859 [2022-07-21 08:10:13,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:10:13,163 INFO L413 NwaCegarLoop]: 451 mSDtfsCounter, 141 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:10:13,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 755 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:10:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31859 states. [2022-07-21 08:10:14,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31859 to 31775. [2022-07-21 08:10:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31775 states, 26625 states have (on average 1.2862347417840376) internal successors, (34246), 27174 states have internal predecessors, (34246), 2569 states have call successors, (2569), 1888 states have call predecessors, (2569), 2579 states have return successors, (5056), 2730 states have call predecessors, (5056), 2565 states have call successors, (5056) [2022-07-21 08:10:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31775 states to 31775 states and 41871 transitions. [2022-07-21 08:10:14,917 INFO L78 Accepts]: Start accepts. Automaton has 31775 states and 41871 transitions. Word has length 163 [2022-07-21 08:10:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:10:14,917 INFO L495 AbstractCegarLoop]: Abstraction has 31775 states and 41871 transitions. [2022-07-21 08:10:14,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 08:10:14,918 INFO L276 IsEmpty]: Start isEmpty. Operand 31775 states and 41871 transitions. [2022-07-21 08:10:14,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-21 08:10:14,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:10:14,944 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:10:14,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 08:10:15,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-21 08:10:15,145 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:10:15,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:10:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1271742787, now seen corresponding path program 1 times [2022-07-21 08:10:15,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:10:15,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286322503] [2022-07-21 08:10:15,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:15,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:10:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:15,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:10:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:15,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:10:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:15,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:10:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:15,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:10:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:15,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:10:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:15,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:10:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:15,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 08:10:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:15,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:15,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 08:10:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:15,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:15,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 08:10:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:15,229 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-21 08:10:15,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:10:15,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286322503] [2022-07-21 08:10:15,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286322503] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:10:15,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742710539] [2022-07-21 08:10:15,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:15,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:15,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:10:15,231 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:10:15,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-21 08:10:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:15,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:10:15,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:10:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-21 08:10:15,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:10:15,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742710539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:10:15,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:10:15,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:10:15,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003362615] [2022-07-21 08:10:15,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:10:15,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:10:15,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:10:15,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:10:15,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:10:15,381 INFO L87 Difference]: Start difference. First operand 31775 states and 41871 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 08:10:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:10:17,142 INFO L93 Difference]: Finished difference Result 54728 states and 74324 transitions. [2022-07-21 08:10:17,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:10:17,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 163 [2022-07-21 08:10:17,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:10:17,214 INFO L225 Difference]: With dead ends: 54728 [2022-07-21 08:10:17,214 INFO L226 Difference]: Without dead ends: 30957 [2022-07-21 08:10:17,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:10:17,251 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 285 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:10:17,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 365 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:10:17,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30957 states. [2022-07-21 08:10:18,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30957 to 22939. [2022-07-21 08:10:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22939 states, 19187 states have (on average 1.2382342210871944) internal successors, (23758), 19563 states have internal predecessors, (23758), 1865 states have call successors, (1865), 1390 states have call predecessors, (1865), 1885 states have return successors, (3347), 1995 states have call predecessors, (3347), 1861 states have call successors, (3347) [2022-07-21 08:10:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22939 states to 22939 states and 28970 transitions. [2022-07-21 08:10:18,712 INFO L78 Accepts]: Start accepts. Automaton has 22939 states and 28970 transitions. Word has length 163 [2022-07-21 08:10:18,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:10:18,713 INFO L495 AbstractCegarLoop]: Abstraction has 22939 states and 28970 transitions. [2022-07-21 08:10:18,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-21 08:10:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 22939 states and 28970 transitions. [2022-07-21 08:10:18,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-21 08:10:18,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:10:18,726 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:10:18,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-21 08:10:18,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-21 08:10:18,927 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:10:18,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:10:18,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1192837573, now seen corresponding path program 1 times [2022-07-21 08:10:18,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:10:18,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073935816] [2022-07-21 08:10:18,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:18,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:10:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:18,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:10:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:18,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:10:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:18,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:10:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:18,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:10:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:18,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:10:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:18,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:10:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:18,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 08:10:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:18,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:18,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 08:10:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:18,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:19,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 08:10:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-21 08:10:19,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:10:19,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073935816] [2022-07-21 08:10:19,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073935816] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:10:19,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508702203] [2022-07-21 08:10:19,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:19,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:19,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:10:19,004 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:10:19,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-21 08:10:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:19,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 08:10:19,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:10:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 08:10:19,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:10:19,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508702203] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:10:19,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:10:19,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-21 08:10:19,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810437015] [2022-07-21 08:10:19,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:10:19,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 08:10:19,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:10:19,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 08:10:19,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:10:19,274 INFO L87 Difference]: Start difference. First operand 22939 states and 28970 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:10:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:10:20,753 INFO L93 Difference]: Finished difference Result 41372 states and 52881 transitions. [2022-07-21 08:10:20,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 08:10:20,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-07-21 08:10:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:10:20,805 INFO L225 Difference]: With dead ends: 41372 [2022-07-21 08:10:20,805 INFO L226 Difference]: Without dead ends: 22891 [2022-07-21 08:10:20,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:10:20,840 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 376 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 08:10:20,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 611 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 08:10:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22891 states. [2022-07-21 08:10:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22891 to 22891. [2022-07-21 08:10:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22891 states, 19139 states have (on average 1.2137520246616855) internal successors, (23230), 19515 states have internal predecessors, (23230), 1865 states have call successors, (1865), 1390 states have call predecessors, (1865), 1885 states have return successors, (3347), 1995 states have call predecessors, (3347), 1861 states have call successors, (3347) [2022-07-21 08:10:22,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22891 states to 22891 states and 28442 transitions. [2022-07-21 08:10:22,229 INFO L78 Accepts]: Start accepts. Automaton has 22891 states and 28442 transitions. Word has length 165 [2022-07-21 08:10:22,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:10:22,229 INFO L495 AbstractCegarLoop]: Abstraction has 22891 states and 28442 transitions. [2022-07-21 08:10:22,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:10:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 22891 states and 28442 transitions. [2022-07-21 08:10:22,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-21 08:10:22,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:10:22,242 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:10:22,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-21 08:10:22,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-21 08:10:22,449 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:10:22,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:10:22,449 INFO L85 PathProgramCache]: Analyzing trace with hash 100202371, now seen corresponding path program 1 times [2022-07-21 08:10:22,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:10:22,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081833803] [2022-07-21 08:10:22,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:22,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:10:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:22,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:10:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:22,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:10:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:22,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:10:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:22,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:10:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:22,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:10:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:22,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:10:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:22,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 08:10:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:22,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:22,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 08:10:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:22,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:22,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 08:10:22,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:22,522 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-21 08:10:22,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:10:22,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081833803] [2022-07-21 08:10:22,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081833803] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:10:22,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36911679] [2022-07-21 08:10:22,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:22,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:22,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:10:22,524 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:10:22,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-21 08:10:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:22,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 08:10:22,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:10:22,690 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-21 08:10:22,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:10:22,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36911679] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:10:22,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:10:22,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-21 08:10:22,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961988429] [2022-07-21 08:10:22,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:10:22,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 08:10:22,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:10:22,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 08:10:22,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 08:10:22,692 INFO L87 Difference]: Start difference. First operand 22891 states and 28442 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:10:24,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:10:24,440 INFO L93 Difference]: Finished difference Result 40204 states and 51213 transitions. [2022-07-21 08:10:24,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 08:10:24,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-07-21 08:10:24,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:10:24,491 INFO L225 Difference]: With dead ends: 40204 [2022-07-21 08:10:24,491 INFO L226 Difference]: Without dead ends: 22497 [2022-07-21 08:10:24,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-21 08:10:24,520 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 403 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 08:10:24,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 623 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 08:10:24,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22497 states. [2022-07-21 08:10:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22497 to 20464. [2022-07-21 08:10:25,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20464 states, 17096 states have (on average 1.1868858212447355) internal successors, (20291), 17424 states have internal predecessors, (20291), 1673 states have call successors, (1673), 1250 states have call predecessors, (1673), 1693 states have return successors, (2867), 1795 states have call predecessors, (2867), 1669 states have call successors, (2867) [2022-07-21 08:10:25,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20464 states to 20464 states and 24831 transitions. [2022-07-21 08:10:25,940 INFO L78 Accepts]: Start accepts. Automaton has 20464 states and 24831 transitions. Word has length 165 [2022-07-21 08:10:25,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:10:25,940 INFO L495 AbstractCegarLoop]: Abstraction has 20464 states and 24831 transitions. [2022-07-21 08:10:25,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:10:25,940 INFO L276 IsEmpty]: Start isEmpty. Operand 20464 states and 24831 transitions. [2022-07-21 08:10:25,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-21 08:10:25,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:10:25,950 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:10:25,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-21 08:10:26,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-21 08:10:26,151 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:10:26,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:10:26,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1742273343, now seen corresponding path program 1 times [2022-07-21 08:10:26,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:10:26,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072027756] [2022-07-21 08:10:26,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:26,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:10:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:26,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:10:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:26,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:10:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:26,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:10:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:26,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:10:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:26,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:10:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:26,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:10:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:26,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 08:10:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:26,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:26,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 08:10:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:26,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:26,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 08:10:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-21 08:10:26,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:10:26,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072027756] [2022-07-21 08:10:26,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072027756] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:10:26,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804387969] [2022-07-21 08:10:26,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:26,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:26,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:10:26,226 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:10:26,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-21 08:10:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:26,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 08:10:26,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:10:26,340 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-21 08:10:26,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:10:26,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804387969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:10:26,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:10:26,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-21 08:10:26,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784705474] [2022-07-21 08:10:26,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:10:26,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 08:10:26,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:10:26,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 08:10:26,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:10:26,343 INFO L87 Difference]: Start difference. First operand 20464 states and 24831 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:10:27,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:10:27,627 INFO L93 Difference]: Finished difference Result 36204 states and 44667 transitions. [2022-07-21 08:10:27,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 08:10:27,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-07-21 08:10:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:10:27,666 INFO L225 Difference]: With dead ends: 36204 [2022-07-21 08:10:27,666 INFO L226 Difference]: Without dead ends: 20200 [2022-07-21 08:10:27,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:10:27,688 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 49 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:10:27,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1314 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:10:27,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20200 states. [2022-07-21 08:10:28,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20200 to 19820. [2022-07-21 08:10:28,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19820 states, 16477 states have (on average 1.171997329610973) internal successors, (19311), 16788 states have internal predecessors, (19311), 1673 states have call successors, (1673), 1250 states have call predecessors, (1673), 1668 states have return successors, (2727), 1787 states have call predecessors, (2727), 1669 states have call successors, (2727) [2022-07-21 08:10:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19820 states to 19820 states and 23711 transitions. [2022-07-21 08:10:28,892 INFO L78 Accepts]: Start accepts. Automaton has 19820 states and 23711 transitions. Word has length 165 [2022-07-21 08:10:28,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:10:28,893 INFO L495 AbstractCegarLoop]: Abstraction has 19820 states and 23711 transitions. [2022-07-21 08:10:28,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:10:28,893 INFO L276 IsEmpty]: Start isEmpty. Operand 19820 states and 23711 transitions. [2022-07-21 08:10:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-21 08:10:28,902 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:10:28,902 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:10:28,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-21 08:10:29,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:29,103 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:10:29,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:10:29,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1910661765, now seen corresponding path program 1 times [2022-07-21 08:10:29,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:10:29,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868753837] [2022-07-21 08:10:29,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:29,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:10:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:29,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:10:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:29,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:10:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:29,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:10:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:29,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:10:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:29,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:10:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:29,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 08:10:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:29,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 08:10:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:29,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:29,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 08:10:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:29,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:29,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-21 08:10:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-21 08:10:29,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:10:29,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868753837] [2022-07-21 08:10:29,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868753837] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:10:29,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287598396] [2022-07-21 08:10:29,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:29,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:29,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:10:29,172 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:10:29,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-21 08:10:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:29,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 08:10:29,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:10:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-21 08:10:29,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:10:29,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287598396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:10:29,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:10:29,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-21 08:10:29,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404612025] [2022-07-21 08:10:29,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:10:29,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 08:10:29,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:10:29,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 08:10:29,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:10:29,280 INFO L87 Difference]: Start difference. First operand 19820 states and 23711 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:10:30,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:10:30,383 INFO L93 Difference]: Finished difference Result 29556 states and 35690 transitions. [2022-07-21 08:10:30,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 08:10:30,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2022-07-21 08:10:30,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:10:30,419 INFO L225 Difference]: With dead ends: 29556 [2022-07-21 08:10:30,419 INFO L226 Difference]: Without dead ends: 14193 [2022-07-21 08:10:30,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 185 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-21 08:10:30,443 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 10 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:10:30,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1299 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:10:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14193 states. [2022-07-21 08:10:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14193 to 14137. [2022-07-21 08:10:31,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14137 states, 11744 states have (on average 1.1673194822888284) internal successors, (13709), 11906 states have internal predecessors, (13709), 1230 states have call successors, (1230), 914 states have call predecessors, (1230), 1161 states have return successors, (1768), 1320 states have call predecessors, (1768), 1226 states have call successors, (1768) [2022-07-21 08:10:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14137 states to 14137 states and 16707 transitions. [2022-07-21 08:10:31,432 INFO L78 Accepts]: Start accepts. Automaton has 14137 states and 16707 transitions. Word has length 165 [2022-07-21 08:10:31,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:10:31,432 INFO L495 AbstractCegarLoop]: Abstraction has 14137 states and 16707 transitions. [2022-07-21 08:10:31,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 08:10:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 14137 states and 16707 transitions. [2022-07-21 08:10:31,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-21 08:10:31,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:10:31,439 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:10:31,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-21 08:10:31,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:31,641 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:10:31,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:10:31,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1582737387, now seen corresponding path program 1 times [2022-07-21 08:10:31,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:10:31,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013770986] [2022-07-21 08:10:31,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:31,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:10:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:10:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:10:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:10:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:10:31,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:10:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 08:10:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 08:10:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 08:10:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 08:10:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 08:10:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 08:10:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:10:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:10:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 08:10:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 08:10:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-21 08:10:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:10:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:10:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 08:10:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 08:10:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-21 08:10:31,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:10:31,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013770986] [2022-07-21 08:10:31,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013770986] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:10:31,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885682891] [2022-07-21 08:10:31,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:31,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:31,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:10:31,731 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:10:31,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-21 08:10:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:31,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:10:31,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:10:31,961 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-21 08:10:31,962 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:10:31,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885682891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:10:31,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:10:31,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-21 08:10:31,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771247543] [2022-07-21 08:10:31,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:10:31,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:10:31,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:10:31,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:10:31,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:10:31,964 INFO L87 Difference]: Start difference. First operand 14137 states and 16707 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 08:10:32,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:10:32,962 INFO L93 Difference]: Finished difference Result 23005 states and 27445 transitions. [2022-07-21 08:10:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:10:32,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 195 [2022-07-21 08:10:32,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:10:33,010 INFO L225 Difference]: With dead ends: 23005 [2022-07-21 08:10:33,011 INFO L226 Difference]: Without dead ends: 18571 [2022-07-21 08:10:33,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:10:33,027 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 52 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:10:33,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 645 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:10:33,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18571 states. [2022-07-21 08:10:34,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18571 to 18561. [2022-07-21 08:10:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18561 states, 15181 states have (on average 1.1741650747645083) internal successors, (17825), 15403 states have internal predecessors, (17825), 1730 states have call successors, (1730), 1278 states have call predecessors, (1730), 1648 states have return successors, (2461), 1883 states have call predecessors, (2461), 1726 states have call successors, (2461) [2022-07-21 08:10:34,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18561 states to 18561 states and 22016 transitions. [2022-07-21 08:10:34,219 INFO L78 Accepts]: Start accepts. Automaton has 18561 states and 22016 transitions. Word has length 195 [2022-07-21 08:10:34,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:10:34,219 INFO L495 AbstractCegarLoop]: Abstraction has 18561 states and 22016 transitions. [2022-07-21 08:10:34,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 08:10:34,219 INFO L276 IsEmpty]: Start isEmpty. Operand 18561 states and 22016 transitions. [2022-07-21 08:10:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-21 08:10:34,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:10:34,228 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:10:34,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-21 08:10:34,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:34,428 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:10:34,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:10:34,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1814836631, now seen corresponding path program 1 times [2022-07-21 08:10:34,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:10:34,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131521839] [2022-07-21 08:10:34,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:34,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:10:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:10:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:10:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 08:10:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:10:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 08:10:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 08:10:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 08:10:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 08:10:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 08:10:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 08:10:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-21 08:10:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:10:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:10:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 08:10:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 08:10:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-21 08:10:34,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 08:10:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 08:10:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 08:10:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 08:10:34,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-21 08:10:34,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:10:34,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131521839] [2022-07-21 08:10:34,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131521839] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:10:34,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532236777] [2022-07-21 08:10:34,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:34,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:34,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:10:34,501 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:10:34,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-21 08:10:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:34,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:10:34,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:10:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-21 08:10:34,739 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:10:34,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532236777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:10:34,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:10:34,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-21 08:10:34,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027850455] [2022-07-21 08:10:34,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:10:34,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:10:34,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:10:34,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:10:34,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:10:34,740 INFO L87 Difference]: Start difference. First operand 18561 states and 22016 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-21 08:10:35,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:10:35,839 INFO L93 Difference]: Finished difference Result 25091 states and 30256 transitions. [2022-07-21 08:10:35,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:10:35,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 195 [2022-07-21 08:10:35,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:10:35,859 INFO L225 Difference]: With dead ends: 25091 [2022-07-21 08:10:35,859 INFO L226 Difference]: Without dead ends: 9692 [2022-07-21 08:10:35,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 08:10:35,879 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 207 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:10:35,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 311 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:10:35,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9692 states. [2022-07-21 08:10:36,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9692 to 9692. [2022-07-21 08:10:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9692 states, 8295 states have (on average 1.1487643158529235) internal successors, (9529), 8394 states have internal predecessors, (9529), 722 states have call successors, (722), 549 states have call predecessors, (722), 674 states have return successors, (1068), 750 states have call predecessors, (1068), 720 states have call successors, (1068) [2022-07-21 08:10:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9692 states to 9692 states and 11319 transitions. [2022-07-21 08:10:36,561 INFO L78 Accepts]: Start accepts. Automaton has 9692 states and 11319 transitions. Word has length 195 [2022-07-21 08:10:36,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:10:36,562 INFO L495 AbstractCegarLoop]: Abstraction has 9692 states and 11319 transitions. [2022-07-21 08:10:36,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-21 08:10:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 9692 states and 11319 transitions. [2022-07-21 08:10:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-21 08:10:36,569 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:10:36,570 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:10:36,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-21 08:10:36,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-21 08:10:36,784 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:10:36,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:10:36,784 INFO L85 PathProgramCache]: Analyzing trace with hash -55403990, now seen corresponding path program 1 times [2022-07-21 08:10:36,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:10:36,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312089505] [2022-07-21 08:10:36,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:36,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:10:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:36,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:10:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:36,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:10:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:36,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:10:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:36,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:10:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:36,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:10:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:36,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 08:10:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:36,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:36,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 08:10:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:36,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 08:10:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:36,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:36,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 08:10:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:36,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:36,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-21 08:10:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-21 08:10:36,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:10:36,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312089505] [2022-07-21 08:10:36,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312089505] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:10:36,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556510181] [2022-07-21 08:10:36,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:36,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:36,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:10:36,863 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:10:36,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-21 08:10:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:36,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 08:10:36,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:10:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-21 08:10:36,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:10:36,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556510181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:10:36,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:10:36,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-21 08:10:36,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234534253] [2022-07-21 08:10:36,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:10:36,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:10:36,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:10:36,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:10:36,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:10:36,982 INFO L87 Difference]: Start difference. First operand 9692 states and 11319 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 08:10:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:10:37,282 INFO L93 Difference]: Finished difference Result 12798 states and 14928 transitions. [2022-07-21 08:10:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:10:37,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 200 [2022-07-21 08:10:37,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:10:37,288 INFO L225 Difference]: With dead ends: 12798 [2022-07-21 08:10:37,288 INFO L226 Difference]: Without dead ends: 2922 [2022-07-21 08:10:37,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 08:10:37,297 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 138 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:10:37,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 426 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:10:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2022-07-21 08:10:37,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2922. [2022-07-21 08:10:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2482 states have (on average 1.128928283642224) internal successors, (2802), 2504 states have internal predecessors, (2802), 247 states have call successors, (247), 176 states have call predecessors, (247), 192 states have return successors, (282), 243 states have call predecessors, (282), 245 states have call successors, (282) [2022-07-21 08:10:37,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 3331 transitions. [2022-07-21 08:10:37,541 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 3331 transitions. Word has length 200 [2022-07-21 08:10:37,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:10:37,541 INFO L495 AbstractCegarLoop]: Abstraction has 2922 states and 3331 transitions. [2022-07-21 08:10:37,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-21 08:10:37,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3331 transitions. [2022-07-21 08:10:37,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-21 08:10:37,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:10:37,544 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:10:37,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-21 08:10:37,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:37,744 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:10:37,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:10:37,745 INFO L85 PathProgramCache]: Analyzing trace with hash 135104874, now seen corresponding path program 1 times [2022-07-21 08:10:37,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:10:37,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485846717] [2022-07-21 08:10:37,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:37,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:10:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:37,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:10:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:37,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:10:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:37,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:10:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:37,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:10:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:37,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:10:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:37,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 08:10:37,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:37,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 08:10:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:37,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:37,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 08:10:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:37,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-21 08:10:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:37,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:37,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-21 08:10:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:37,822 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 53 proven. 41 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-21 08:10:37,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:10:37,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485846717] [2022-07-21 08:10:37,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485846717] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 08:10:37,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983319187] [2022-07-21 08:10:37,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:37,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:37,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 08:10:37,824 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 08:10:37,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-21 08:10:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:37,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 08:10:37,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 08:10:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-21 08:10:37,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 08:10:37,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983319187] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:10:37,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 08:10:37,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-07-21 08:10:37,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146899195] [2022-07-21 08:10:37,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:10:37,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 08:10:37,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:10:37,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 08:10:37,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:10:37,987 INFO L87 Difference]: Start difference. First operand 2922 states and 3331 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-21 08:10:38,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:10:38,165 INFO L93 Difference]: Finished difference Result 5145 states and 5903 transitions. [2022-07-21 08:10:38,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 08:10:38,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 201 [2022-07-21 08:10:38,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:10:38,171 INFO L225 Difference]: With dead ends: 5145 [2022-07-21 08:10:38,171 INFO L226 Difference]: Without dead ends: 2922 [2022-07-21 08:10:38,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 225 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:10:38,175 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 106 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 08:10:38,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 379 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 08:10:38,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2022-07-21 08:10:38,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2922. [2022-07-21 08:10:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2922 states, 2482 states have (on average 1.1180499597099114) internal successors, (2775), 2504 states have internal predecessors, (2775), 247 states have call successors, (247), 176 states have call predecessors, (247), 192 states have return successors, (282), 243 states have call predecessors, (282), 245 states have call successors, (282) [2022-07-21 08:10:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 3304 transitions. [2022-07-21 08:10:38,361 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 3304 transitions. Word has length 201 [2022-07-21 08:10:38,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:10:38,361 INFO L495 AbstractCegarLoop]: Abstraction has 2922 states and 3304 transitions. [2022-07-21 08:10:38,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-21 08:10:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3304 transitions. [2022-07-21 08:10:38,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-21 08:10:38,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:10:38,364 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:10:38,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-21 08:10:38,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 08:10:38,565 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:10:38,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:10:38,565 INFO L85 PathProgramCache]: Analyzing trace with hash 171826558, now seen corresponding path program 1 times [2022-07-21 08:10:38,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:10:38,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599959352] [2022-07-21 08:10:38,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:38,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:10:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:38,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:10:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:38,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:10:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:38,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:10:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:38,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:10:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:38,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:10:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:38,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 08:10:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:38,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 08:10:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:38,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:38,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 08:10:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:38,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:38,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 08:10:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:38,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:38,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 08:10:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:38,678 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-21 08:10:38,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:10:38,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599959352] [2022-07-21 08:10:38,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599959352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:10:38,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:10:38,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 08:10:38,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101869704] [2022-07-21 08:10:38,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:10:38,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 08:10:38,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:10:38,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 08:10:38,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 08:10:38,680 INFO L87 Difference]: Start difference. First operand 2922 states and 3304 transitions. Second operand has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-21 08:10:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:10:39,495 INFO L93 Difference]: Finished difference Result 3320 states and 3736 transitions. [2022-07-21 08:10:39,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 08:10:39,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 203 [2022-07-21 08:10:39,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:10:39,502 INFO L225 Difference]: With dead ends: 3320 [2022-07-21 08:10:39,503 INFO L226 Difference]: Without dead ends: 3317 [2022-07-21 08:10:39,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-07-21 08:10:39,504 INFO L413 NwaCegarLoop]: 333 mSDtfsCounter, 688 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 08:10:39,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 927 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 08:10:39,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-07-21 08:10:39,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3086. [2022-07-21 08:10:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 2621 states have (on average 1.1175123998473866) internal successors, (2929), 2643 states have internal predecessors, (2929), 261 states have call successors, (261), 186 states have call predecessors, (261), 203 states have return successors, (298), 258 states have call predecessors, (298), 260 states have call successors, (298) [2022-07-21 08:10:39,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 3488 transitions. [2022-07-21 08:10:39,725 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 3488 transitions. Word has length 203 [2022-07-21 08:10:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:10:39,726 INFO L495 AbstractCegarLoop]: Abstraction has 3086 states and 3488 transitions. [2022-07-21 08:10:39,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 5 states have internal predecessors, (112), 6 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-21 08:10:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 3488 transitions. [2022-07-21 08:10:39,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-21 08:10:39,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:10:39,729 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:10:39,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-21 08:10:39,729 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:10:39,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:10:39,730 INFO L85 PathProgramCache]: Analyzing trace with hash -190863834, now seen corresponding path program 1 times [2022-07-21 08:10:39,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:10:39,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873727609] [2022-07-21 08:10:39,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:39,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:10:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:39,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 08:10:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:39,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 08:10:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:39,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 08:10:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:39,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 08:10:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:39,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-21 08:10:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:39,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-21 08:10:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:39,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 08:10:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:39,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 08:10:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:39,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:39,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 08:10:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:39,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 08:10:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:39,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 08:10:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 08:10:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2022-07-21 08:10:39,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 08:10:39,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873727609] [2022-07-21 08:10:39,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873727609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 08:10:39,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 08:10:39,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 08:10:39,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682405303] [2022-07-21 08:10:39,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 08:10:39,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 08:10:39,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 08:10:39,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 08:10:39,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 08:10:39,782 INFO L87 Difference]: Start difference. First operand 3086 states and 3488 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 08:10:40,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 08:10:40,238 INFO L93 Difference]: Finished difference Result 5135 states and 5909 transitions. [2022-07-21 08:10:40,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 08:10:40,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 207 [2022-07-21 08:10:40,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 08:10:40,246 INFO L225 Difference]: With dead ends: 5135 [2022-07-21 08:10:40,246 INFO L226 Difference]: Without dead ends: 3747 [2022-07-21 08:10:40,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 08:10:40,249 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 197 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 08:10:40,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 568 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 08:10:40,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states. [2022-07-21 08:10:40,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 3089. [2022-07-21 08:10:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3089 states, 2624 states have (on average 1.1173780487804879) internal successors, (2932), 2646 states have internal predecessors, (2932), 261 states have call successors, (261), 186 states have call predecessors, (261), 203 states have return successors, (298), 258 states have call predecessors, (298), 260 states have call successors, (298) [2022-07-21 08:10:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 3491 transitions. [2022-07-21 08:10:40,473 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 3491 transitions. Word has length 207 [2022-07-21 08:10:40,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 08:10:40,474 INFO L495 AbstractCegarLoop]: Abstraction has 3089 states and 3491 transitions. [2022-07-21 08:10:40,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 3 states have internal predecessors, (101), 3 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 08:10:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 3491 transitions. [2022-07-21 08:10:40,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-21 08:10:40,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 08:10:40,477 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 08:10:40,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-21 08:10:40,477 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 08:10:40,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 08:10:40,478 INFO L85 PathProgramCache]: Analyzing trace with hash -392769361, now seen corresponding path program 1 times [2022-07-21 08:10:40,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 08:10:40,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264964895] [2022-07-21 08:10:40,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 08:10:40,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 08:10:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:10:40,489 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 08:10:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 08:10:40,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 08:10:40,560 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 08:10:40,560 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-21 08:10:40,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-21 08:10:40,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-21 08:10:40,564 INFO L356 BasicCegarLoop]: Path program 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] [2022-07-21 08:10:40,567 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 08:10:40,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 08:10:40 BoogieIcfgContainer [2022-07-21 08:10:40,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 08:10:40,706 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 08:10:40,706 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 08:10:40,706 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 08:10:40,707 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 08:09:35" (3/4) ... [2022-07-21 08:10:40,708 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 08:10:40,827 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 08:10:40,827 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 08:10:40,828 INFO L158 Benchmark]: Toolchain (without parser) took 66445.72ms. Allocated memory was 60.8MB in the beginning and 6.5GB in the end (delta: 6.4GB). Free memory was 39.7MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2022-07-21 08:10:40,831 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 60.8MB. Free memory was 42.2MB in the beginning and 42.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 08:10:40,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.40ms. Allocated memory is still 60.8MB. Free memory was 39.5MB in the beginning and 36.9MB in the end (delta: 2.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-21 08:10:40,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.21ms. Allocated memory is still 60.8MB. Free memory was 36.9MB in the beginning and 33.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 08:10:40,832 INFO L158 Benchmark]: Boogie Preprocessor took 36.53ms. Allocated memory is still 60.8MB. Free memory was 33.9MB in the beginning and 31.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 08:10:40,832 INFO L158 Benchmark]: RCFGBuilder took 629.54ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 31.3MB in the beginning and 33.1MB in the end (delta: -1.8MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2022-07-21 08:10:40,832 INFO L158 Benchmark]: TraceAbstraction took 65258.62ms. Allocated memory was 73.4MB in the beginning and 6.5GB in the end (delta: 6.4GB). Free memory was 32.4MB in the beginning and 4.4GB in the end (delta: -4.4GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2022-07-21 08:10:40,833 INFO L158 Benchmark]: Witness Printer took 121.36ms. Allocated memory is still 6.5GB. Free memory was 4.4GB in the beginning and 4.4GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-21 08:10:40,833 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.18ms. Allocated memory is still 60.8MB. Free memory was 42.2MB in the beginning and 42.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.40ms. Allocated memory is still 60.8MB. Free memory was 39.5MB in the beginning and 36.9MB in the end (delta: 2.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.21ms. Allocated memory is still 60.8MB. Free memory was 36.9MB in the beginning and 33.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.53ms. Allocated memory is still 60.8MB. Free memory was 33.9MB in the beginning and 31.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 629.54ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 31.3MB in the beginning and 33.1MB in the end (delta: -1.8MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * TraceAbstraction took 65258.62ms. Allocated memory was 73.4MB in the beginning and 6.5GB in the end (delta: 6.4GB). Free memory was 32.4MB in the beginning and 4.4GB in the end (delta: -4.4GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 121.36ms. Allocated memory is still 6.5GB. Free memory was 4.4GB in the beginning and 4.4GB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. 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: 599]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int fast_clk_edge ; [L33] int slow_clk_edge ; [L34] int q_buf_0 ; [L35] int q_free ; [L36] int q_read_ev ; [L37] int q_write_ev ; [L38] int q_req_up ; [L39] int q_ev ; [L60] int p_num_write ; [L61] int p_last_write ; [L62] int p_dw_st ; [L63] int p_dw_pc ; [L64] int p_dw_i ; [L65] int c_num_read ; [L66] int c_last_read ; [L67] int c_dr_st ; [L68] int c_dr_pc ; [L69] int c_dr_i ; [L202] static int a_t ; [L352] static int t = 0; [L603] int m_pc = 0; [L604] int t1_pc = 0; [L605] int t2_pc = 0; [L606] int m_st ; [L607] int t1_st ; [L608] int t2_st ; [L609] int m_i ; [L610] int t1_i ; [L611] int t2_i ; [L612] int M_E = 2; [L613] int T1_E = 2; [L614] int T2_E = 2; [L615] int E_M = 2; [L616] int E_1 = 2; [L617] int E_2 = 2; [L622] int token ; [L624] 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_M=2, fast_clk_edge=0, 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, slow_clk_edge=0, t=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, token=0] [L1202] COND FALSE !(__VERIFIER_nondet_int()) [L1205] CALL main2() [L1189] int __retres1 ; [L1193] CALL init_model2() [L1103] m_i = 1 [L1104] t1_i = 1 [L1105] t2_i = 1 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1193] RET init_model2() [L1194] CALL start_simulation2() [L1130] int kernel_st ; [L1131] int tmp ; [L1132] int tmp___0 ; [L1136] kernel_st = 0 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_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1137] FCALL update_channels2() 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_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1138] CALL init_threads2() [L822] COND TRUE m_i == 1 [L823] m_st = 0 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L827] COND TRUE t1_i == 1 [L828] t1_st = 0 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L832] COND TRUE t2_i == 1 [L833] t2_st = 0 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1138] RET init_threads2() [L1139] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L935] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L940] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L945] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L950] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L955] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L960] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1139] RET fire_delta_events2() 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_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1140] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L757] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L767] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L769] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, token=0] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L776] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L786] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L788] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L795] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L805] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L807] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0, token=0] [L1140] RET activate_threads2() 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_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1141] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L973] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L978] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L983] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L988] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L993] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L998] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1141] RET reset_delta_events2() 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_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1144] COND TRUE 1 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_M=2, fast_clk_edge=0, kernel_st=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L1147] kernel_st = 1 [L1148] CALL eval2() [L868] int tmp ; 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L872] COND TRUE 1 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] CALL, EXPR exists_runnable_thread2() 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L842] int __retres1 ; 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L845] COND TRUE m_st == 0 [L846] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L863] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] RET, EXPR exists_runnable_thread2() 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_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L875] tmp = exists_runnable_thread2() [L877] COND TRUE \read(tmp) 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, token=0] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND FALSE !(\read(tmp_ndt_1)) 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0, token=0] [L896] COND TRUE t1_st == 0 [L897] int tmp_ndt_2; [L898] tmp_ndt_2 = __VERIFIER_nondet_int() [L899] COND TRUE \read(tmp_ndt_2) [L901] t1_st = 1 [L902] CALL transmit1() [L685] COND TRUE t1_pc == 0 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L696] COND TRUE 1 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L698] t1_pc = 1 [L699] t1_st = 2 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L902] RET transmit1() [L910] COND TRUE t2_st == 0 [L911] int tmp_ndt_3; [L912] tmp_ndt_3 = __VERIFIER_nondet_int() [L913] COND TRUE \read(tmp_ndt_3) [L915] t2_st = 1 [L916] CALL transmit2() [L721] COND TRUE t2_pc == 0 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L732] COND TRUE 1 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L734] t2_pc = 1 [L735] t2_st = 2 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L916] RET transmit2() [L872] COND TRUE 1 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2, token=0] [L875] CALL, EXPR exists_runnable_thread2() 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L842] int __retres1 ; 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L845] COND TRUE m_st == 0 [L846] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L863] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L875] RET, EXPR exists_runnable_thread2() 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_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2, token=0] [L875] tmp = exists_runnable_thread2() [L877] COND TRUE \read(tmp) 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=-1, tmp_ndt_3=-2, token=0] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND TRUE \read(tmp_ndt_1) [L887] m_st = 1 [L888] CALL master() [L627] int tmp_var = __VERIFIER_nondet_int(); [L629] COND TRUE m_pc == 0 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L640] COND TRUE 1 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L643] token = __VERIFIER_nondet_int() [L644] local = token [L645] E_1 = 1 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=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L646] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1046] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L757] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L767] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L769] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=0] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L776] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L777] COND TRUE E_1 == 1 [L778] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L788] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND TRUE \read(tmp___0) [L1025] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, token=0] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L795] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L796] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L805] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L807] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0, token=0] [L1046] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L646] RET immediate_notify() 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=1, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L647] E_1 = 2 [L648] m_pc = 1 [L649] m_st = 2 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=0, token=0] [L888] RET master() [L896] COND TRUE t1_st == 0 [L897] int tmp_ndt_2; [L898] tmp_ndt_2 = __VERIFIER_nondet_int() [L899] COND TRUE \read(tmp_ndt_2) [L901] t1_st = 1 [L902] CALL transmit1() [L685] COND FALSE !(t1_pc == 0) 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L688] COND TRUE t1_pc == 1 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L704] token += 1 [L705] E_2 = 1 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=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L706] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1046] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L757] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L758] COND FALSE !(E_M == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L767] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L769] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, token=1] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L776] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L777] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L786] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L788] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0, token=1] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L795] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L796] COND TRUE E_2 == 1 [L797] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L807] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND TRUE \read(tmp___1) [L1033] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1, token=1] [L1046] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L706] RET immediate_notify() 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=1, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L707] E_2 = 2 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L696] COND TRUE 1 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L698] t1_pc = 1 [L699] t1_st = 2 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L902] RET transmit1() [L910] COND TRUE t2_st == 0 [L911] int tmp_ndt_3; [L912] tmp_ndt_3 = __VERIFIER_nondet_int() [L913] COND TRUE \read(tmp_ndt_3) [L915] t2_st = 1 [L916] CALL transmit2() [L721] COND FALSE !(t2_pc == 0) 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L724] COND TRUE t2_pc == 1 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L740] token += 1 [L741] E_M = 1 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_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L742] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1046] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1008] int tmp ; [L1009] int tmp___0 ; [L1010] int tmp___1 ; [L1014] CALL, EXPR is_master_triggered() [L754] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L757] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L758] COND TRUE E_M == 1 [L759] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L769] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1014] RET, EXPR is_master_triggered() [L1014] tmp = is_master_triggered() [L1016] COND TRUE \read(tmp) [L1017] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, token=2] [L1022] CALL, EXPR is_transmit1_triggered() [L773] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L776] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L777] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L786] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L788] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1022] RET, EXPR is_transmit1_triggered() [L1022] tmp___0 = is_transmit1_triggered() [L1024] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, token=2] [L1030] CALL, EXPR is_transmit2_triggered() [L792] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L795] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L796] COND FALSE !(E_2 == 1) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L805] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L807] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, \result=0, __retres1=0, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L1030] RET, EXPR is_transmit2_triggered() [L1030] tmp___1 = is_transmit2_triggered() [L1032] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, tmp=1, tmp___0=0, tmp___1=0, token=2] [L1046] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=2, \old(t2_st)=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L742] RET immediate_notify() 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_M=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L743] E_M = 2 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L732] COND TRUE 1 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L734] t2_pc = 1 [L735] t2_st = 2 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L916] RET transmit2() [L872] COND TRUE 1 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-3, tmp_ndt_2=4, tmp_ndt_3=-4, token=2] [L875] CALL, EXPR exists_runnable_thread2() 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L842] int __retres1 ; 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L845] COND TRUE m_st == 0 [L846] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L863] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L875] RET, EXPR exists_runnable_thread2() 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_M=2, exists_runnable_thread2()=1, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-3, tmp_ndt_2=4, tmp_ndt_3=-4, token=2] [L875] tmp = exists_runnable_thread2() [L877] COND TRUE \read(tmp) 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=-3, tmp_ndt_2=4, tmp_ndt_3=-4, token=2] [L882] COND TRUE m_st == 0 [L883] int tmp_ndt_1; [L884] tmp_ndt_1 = __VERIFIER_nondet_int() [L885] COND TRUE \read(tmp_ndt_1) [L887] m_st = 1 [L888] CALL master() [L627] int tmp_var = __VERIFIER_nondet_int(); [L629] COND FALSE !(m_pc == 0) 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L632] COND TRUE m_pc == 1 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L654] COND FALSE !(token != local + 2) 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L659] COND TRUE tmp_var <= 5 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L660] COND TRUE tmp_var >= 5 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L665] COND TRUE tmp_var <= 5 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L666] COND TRUE tmp_var >= 5 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L667] COND TRUE tmp_var == 5 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp_var=5, token=2] [L668] CALL error2() 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L599] reach_error() 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_M=2, fast_clk_edge=0, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=0, slow_clk_edge=0, t=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 27]: 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 16 procedures, 257 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 65.1s, OverallIterations: 38, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 33.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19746 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19363 mSDsluCounter, 33741 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20295 mSDsCounter, 4038 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15979 IncrementalHoareTripleChecker+Invalid, 20017 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4038 mSolverCounterUnsat, 13446 mSDtfsCounter, 15979 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4190 GetRequests, 3762 SyntacticMatches, 6 SemanticMatches, 422 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37835occurred in iteration=24, InterpolantAutomatonStates: 342, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 21.0s AutomataMinimizationTime, 37 MinimizatonAttempts, 17467 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 7938 NumberOfCodeBlocks, 7938 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 7675 ConstructedInterpolants, 0 QuantifiedInterpolants, 13803 SizeOfPredicates, 6 NumberOfNonLiveVariables, 10138 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 55 InterpolantComputations, 37 PerfectInterpolantSequences, 4071/4403 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! [2022-07-21 08:10:40,881 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