./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 791161d1 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-?-791161d [2022-07-22 20:51:03,231 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 20:51:03,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 20:51:03,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 20:51:03,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 20:51:03,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 20:51:03,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 20:51:03,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 20:51:03,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 20:51:03,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 20:51:03,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 20:51:03,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 20:51:03,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 20:51:03,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 20:51:03,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 20:51:03,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 20:51:03,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 20:51:03,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 20:51:03,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 20:51:03,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 20:51:03,301 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 20:51:03,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 20:51:03,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 20:51:03,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 20:51:03,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 20:51:03,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 20:51:03,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 20:51:03,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 20:51:03,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 20:51:03,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 20:51:03,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 20:51:03,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 20:51:03,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 20:51:03,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 20:51:03,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 20:51:03,314 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 20:51:03,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 20:51:03,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 20:51:03,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 20:51:03,315 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 20:51:03,316 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 20:51:03,317 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 20:51:03,319 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 20:51:03,342 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 20:51:03,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 20:51:03,342 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 20:51:03,343 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 20:51:03,343 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 20:51:03,343 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 20:51:03,344 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 20:51:03,344 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 20:51:03,344 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 20:51:03,345 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 20:51:03,345 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 20:51:03,345 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 20:51:03,345 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 20:51:03,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 20:51:03,345 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 20:51:03,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 20:51:03,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 20:51:03,346 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 20:51:03,346 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 20:51:03,346 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 20:51:03,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 20:51:03,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 20:51:03,347 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 20:51:03,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 20:51:03,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 20:51:03,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 20:51:03,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 20:51:03,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 20:51:03,348 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 20:51:03,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 20:51:03,348 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 20:51:03,348 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 20:51:03,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 20:51:03,348 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-22 20:51:03,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 20:51:03,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 20:51:03,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 20:51:03,561 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 20:51:03,561 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 20:51:03,562 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-22 20:51:03,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fa66c1e/6f56c4a436304af8a95a3664e855797e/FLAG5f1918838 [2022-07-22 20:51:04,011 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 20:51:04,013 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-22 20:51:04,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fa66c1e/6f56c4a436304af8a95a3664e855797e/FLAG5f1918838 [2022-07-22 20:51:04,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fa66c1e/6f56c4a436304af8a95a3664e855797e [2022-07-22 20:51:04,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 20:51:04,411 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 20:51:04,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 20:51:04,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 20:51:04,433 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 20:51:04,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 08:51:04" (1/1) ... [2022-07-22 20:51:04,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b726c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:51:04, skipping insertion in model container [2022-07-22 20:51:04,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 08:51:04" (1/1) ... [2022-07-22 20:51:04,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 20:51:04,476 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 20:51:04,612 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-22 20:51:04,646 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-22 20:51:04,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 20:51:04,672 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 20:51:04,679 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-22 20:51:04,693 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-22 20:51:04,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 20:51:04,718 INFO L208 MainTranslator]: Completed translation [2022-07-22 20:51:04,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:51:04 WrapperNode [2022-07-22 20:51:04,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 20:51:04,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 20:51:04,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 20:51:04,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 20:51:04,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:51:04" (1/1) ... [2022-07-22 20:51:04,731 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:51:04" (1/1) ... [2022-07-22 20:51:04,757 INFO L137 Inliner]: procedures = 59, calls = 68, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 503 [2022-07-22 20:51:04,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 20:51:04,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 20:51:04,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 20:51:04,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 20:51:04,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:51:04" (1/1) ... [2022-07-22 20:51:04,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:51:04" (1/1) ... [2022-07-22 20:51:04,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:51:04" (1/1) ... [2022-07-22 20:51:04,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:51:04" (1/1) ... [2022-07-22 20:51:04,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:51:04" (1/1) ... [2022-07-22 20:51:04,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:51:04" (1/1) ... [2022-07-22 20:51:04,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:51:04" (1/1) ... [2022-07-22 20:51:04,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 20:51:04,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 20:51:04,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 20:51:04,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 20:51:04,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:51:04" (1/1) ... [2022-07-22 20:51:04,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 20:51:04,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:04,861 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-22 20:51:04,868 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-22 20:51:04,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 20:51:04,919 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-07-22 20:51:04,919 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-07-22 20:51:04,920 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-07-22 20:51:04,920 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-07-22 20:51:04,920 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-07-22 20:51:04,920 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-07-22 20:51:04,920 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-07-22 20:51:04,920 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-07-22 20:51:04,920 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-07-22 20:51:04,920 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-07-22 20:51:04,920 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-07-22 20:51:04,920 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-07-22 20:51:04,920 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-07-22 20:51:04,920 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-07-22 20:51:04,921 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-07-22 20:51:04,921 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-07-22 20:51:04,921 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-07-22 20:51:04,921 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-07-22 20:51:04,921 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-07-22 20:51:04,921 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-07-22 20:51:04,921 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-07-22 20:51:04,921 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-07-22 20:51:04,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 20:51:04,921 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-07-22 20:51:04,921 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-07-22 20:51:04,921 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-07-22 20:51:04,921 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-07-22 20:51:04,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 20:51:04,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 20:51:04,922 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-07-22 20:51:04,922 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-07-22 20:51:04,922 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-07-22 20:51:04,922 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-07-22 20:51:04,984 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 20:51:04,985 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 20:51:05,316 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-07-22 20:51:05,320 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-22 20:51:05,368 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 20:51:05,374 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 20:51:05,374 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-22 20:51:05,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:51:05 BoogieIcfgContainer [2022-07-22 20:51:05,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 20:51:05,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 20:51:05,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 20:51:05,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 20:51:05,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 08:51:04" (1/3) ... [2022-07-22 20:51:05,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7f781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 08:51:05, skipping insertion in model container [2022-07-22 20:51:05,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 08:51:04" (2/3) ... [2022-07-22 20:51:05,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e7f781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 08:51:05, skipping insertion in model container [2022-07-22 20:51:05,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:51:05" (3/3) ... [2022-07-22 20:51:05,390 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.02.cil-2.c [2022-07-22 20:51:05,399 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 20:51:05,402 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-22 20:51:05,446 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 20:51:05,450 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@25267de1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@65a38a78 [2022-07-22 20:51:05,450 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-07-22 20:51:05,454 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-22 20:51:05,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:51:05,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:05,465 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-22 20:51:05,465 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:05,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:05,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1020803089, now seen corresponding path program 1 times [2022-07-22 20:51:05,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:05,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245722672] [2022-07-22 20:51:05,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:05,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:05,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:05,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:05,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:05,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:05,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:51:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:05,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:51:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:05,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:51:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:05,809 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-22 20:51:05,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:05,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245722672] [2022-07-22 20:51:05,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245722672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:05,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:05,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 20:51:05,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142469946] [2022-07-22 20:51:05,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:05,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 20:51:05,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:05,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 20:51:05,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:05,847 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-22 20:51:06,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:06,674 INFO L93 Difference]: Finished difference Result 646 states and 985 transitions. [2022-07-22 20:51:06,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 20:51:06,676 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-22 20:51:06,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:06,688 INFO L225 Difference]: With dead ends: 646 [2022-07-22 20:51:06,689 INFO L226 Difference]: Without dead ends: 397 [2022-07-22 20:51:06,692 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-22 20:51:06,694 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 678 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:06,695 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.6s Time] [2022-07-22 20:51:06,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-07-22 20:51:06,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 358. [2022-07-22 20:51:06,753 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-22 20:51:06,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 513 transitions. [2022-07-22 20:51:06,757 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 513 transitions. Word has length 65 [2022-07-22 20:51:06,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:06,757 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 513 transitions. [2022-07-22 20:51:06,758 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-22 20:51:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 513 transitions. [2022-07-22 20:51:06,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-22 20:51:06,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:06,761 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-22 20:51:06,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 20:51:06,762 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:06,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:06,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1595275567, now seen corresponding path program 1 times [2022-07-22 20:51:06,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:06,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174179616] [2022-07-22 20:51:06,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:06,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:06,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:06,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:06,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:06,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:06,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:51:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:06,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 20:51:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:06,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-22 20:51:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:06,903 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-22 20:51:06,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:06,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174179616] [2022-07-22 20:51:06,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174179616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:06,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:06,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 20:51:06,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175563802] [2022-07-22 20:51:06,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:06,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 20:51:06,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:06,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 20:51:06,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:51:06,906 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-22 20:51:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:08,309 INFO L93 Difference]: Finished difference Result 1391 states and 1973 transitions. [2022-07-22 20:51:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-22 20:51:08,310 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-22 20:51:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:08,316 INFO L225 Difference]: With dead ends: 1391 [2022-07-22 20:51:08,316 INFO L226 Difference]: Without dead ends: 1170 [2022-07-22 20:51:08,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-07-22 20:51:08,319 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-22 20:51:08,319 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-22 20:51:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2022-07-22 20:51:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1031. [2022-07-22 20:51:08,374 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-22 20:51:08,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1403 transitions. [2022-07-22 20:51:08,393 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1403 transitions. Word has length 65 [2022-07-22 20:51:08,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:08,394 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1403 transitions. [2022-07-22 20:51:08,394 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-22 20:51:08,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1403 transitions. [2022-07-22 20:51:08,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 20:51:08,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:08,396 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-22 20:51:08,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 20:51:08,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:08,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:08,397 INFO L85 PathProgramCache]: Analyzing trace with hash -306777911, now seen corresponding path program 1 times [2022-07-22 20:51:08,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:08,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493953778] [2022-07-22 20:51:08,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:08,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:08,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:08,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:08,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:08,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:08,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:08,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:08,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 20:51:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:08,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 20:51:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:08,484 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-22 20:51:08,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:08,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493953778] [2022-07-22 20:51:08,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493953778] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:08,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:08,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 20:51:08,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284124918] [2022-07-22 20:51:08,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:08,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 20:51:08,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:08,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 20:51:08,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:51:08,486 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-22 20:51:09,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:09,038 INFO L93 Difference]: Finished difference Result 2057 states and 2797 transitions. [2022-07-22 20:51:09,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 20:51:09,038 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-22 20:51:09,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:09,043 INFO L225 Difference]: With dead ends: 2057 [2022-07-22 20:51:09,043 INFO L226 Difference]: Without dead ends: 1169 [2022-07-22 20:51:09,045 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-22 20:51:09,046 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 395 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-22 20:51:09,046 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-22 20:51:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2022-07-22 20:51:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 1061. [2022-07-22 20:51:09,082 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-22 20:51:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1430 transitions. [2022-07-22 20:51:09,085 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1430 transitions. Word has length 66 [2022-07-22 20:51:09,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:09,086 INFO L495 AbstractCegarLoop]: Abstraction has 1061 states and 1430 transitions. [2022-07-22 20:51:09,086 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-22 20:51:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1430 transitions. [2022-07-22 20:51:09,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-22 20:51:09,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:09,088 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-22 20:51:09,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 20:51:09,088 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:09,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:09,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1336137209, now seen corresponding path program 1 times [2022-07-22 20:51:09,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:09,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069349804] [2022-07-22 20:51:09,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:09,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:09,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:09,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:09,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:09,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:09,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:09,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:09,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-22 20:51:09,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:09,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-22 20:51:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:09,164 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-22 20:51:09,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:09,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069349804] [2022-07-22 20:51:09,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069349804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:09,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:09,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 20:51:09,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80113411] [2022-07-22 20:51:09,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:09,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 20:51:09,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:09,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 20:51:09,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:51:09,166 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-22 20:51:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:10,390 INFO L93 Difference]: Finished difference Result 3399 states and 4617 transitions. [2022-07-22 20:51:10,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-22 20:51:10,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-22 20:51:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:10,396 INFO L225 Difference]: With dead ends: 3399 [2022-07-22 20:51:10,396 INFO L226 Difference]: Without dead ends: 1304 [2022-07-22 20:51:10,399 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-22 20:51:10,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.8s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:10,400 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.8s Time] [2022-07-22 20:51:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2022-07-22 20:51:10,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1149. [2022-07-22 20:51:10,433 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-22 20:51:10,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1508 transitions. [2022-07-22 20:51:10,438 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1508 transitions. Word has length 66 [2022-07-22 20:51:10,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:10,439 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 1508 transitions. [2022-07-22 20:51:10,439 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-22 20:51:10,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1508 transitions. [2022-07-22 20:51:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 20:51:10,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:10,440 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-22 20:51:10,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 20:51:10,440 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:10,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:10,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1682176981, now seen corresponding path program 1 times [2022-07-22 20:51:10,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:10,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999961299] [2022-07-22 20:51:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:10,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:10,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:10,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:10,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:10,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:10,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:10,491 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-22 20:51:10,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:10,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999961299] [2022-07-22 20:51:10,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999961299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:10,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:10,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:51:10,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887221544] [2022-07-22 20:51:10,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:10,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:51:10,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:10,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:51:10,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:51:10,493 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-22 20:51:11,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:11,042 INFO L93 Difference]: Finished difference Result 1459 states and 1979 transitions. [2022-07-22 20:51:11,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 20:51:11,042 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-22 20:51:11,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:11,047 INFO L225 Difference]: With dead ends: 1459 [2022-07-22 20:51:11,047 INFO L226 Difference]: Without dead ends: 1335 [2022-07-22 20:51:11,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:51:11,052 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.5s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:11,052 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.5s Time] [2022-07-22 20:51:11,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-07-22 20:51:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1270. [2022-07-22 20:51:11,122 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-22 20:51:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1689 transitions. [2022-07-22 20:51:11,126 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1689 transitions. Word has length 69 [2022-07-22 20:51:11,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:11,126 INFO L495 AbstractCegarLoop]: Abstraction has 1270 states and 1689 transitions. [2022-07-22 20:51:11,126 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-22 20:51:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1689 transitions. [2022-07-22 20:51:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 20:51:11,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:11,128 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-22 20:51:11,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 20:51:11,129 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:11,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:11,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1579462617, now seen corresponding path program 1 times [2022-07-22 20:51:11,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:11,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420623203] [2022-07-22 20:51:11,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:11,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:11,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:11,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:11,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:11,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:11,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:11,183 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-22 20:51:11,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:11,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420623203] [2022-07-22 20:51:11,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420623203] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:11,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:11,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:51:11,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790788969] [2022-07-22 20:51:11,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:11,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:51:11,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:11,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:51:11,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:51:11,185 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-22 20:51:11,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:11,886 INFO L93 Difference]: Finished difference Result 1732 states and 2383 transitions. [2022-07-22 20:51:11,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 20:51:11,887 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-22 20:51:11,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:11,892 INFO L225 Difference]: With dead ends: 1732 [2022-07-22 20:51:11,892 INFO L226 Difference]: Without dead ends: 1487 [2022-07-22 20:51:11,893 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-22 20:51:11,893 INFO L413 NwaCegarLoop]: 371 mSDtfsCounter, 684 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:11,893 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.5s Time] [2022-07-22 20:51:11,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2022-07-22 20:51:11,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1384. [2022-07-22 20:51:11,930 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-22 20:51:11,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1855 transitions. [2022-07-22 20:51:11,935 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1855 transitions. Word has length 69 [2022-07-22 20:51:11,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:11,935 INFO L495 AbstractCegarLoop]: Abstraction has 1384 states and 1855 transitions. [2022-07-22 20:51:11,935 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-22 20:51:11,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1855 transitions. [2022-07-22 20:51:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 20:51:11,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:11,936 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-22 20:51:11,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-22 20:51:11,937 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:11,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:11,937 INFO L85 PathProgramCache]: Analyzing trace with hash -192677207, now seen corresponding path program 1 times [2022-07-22 20:51:11,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:11,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297026318] [2022-07-22 20:51:11,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:11,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:11,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:11,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:11,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:11,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:11,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:11,984 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-22 20:51:11,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:11,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297026318] [2022-07-22 20:51:11,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297026318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:11,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:11,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:51:11,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684020049] [2022-07-22 20:51:11,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:11,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:51:11,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:11,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:51:11,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:51:11,987 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-22 20:51:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:12,366 INFO L93 Difference]: Finished difference Result 1842 states and 2549 transitions. [2022-07-22 20:51:12,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 20:51:12,367 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-22 20:51:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:12,371 INFO L225 Difference]: With dead ends: 1842 [2022-07-22 20:51:12,371 INFO L226 Difference]: Without dead ends: 1483 [2022-07-22 20:51:12,372 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-22 20:51:12,373 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 662 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-22 20:51:12,373 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-22 20:51:12,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2022-07-22 20:51:12,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1384. [2022-07-22 20:51:12,417 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-22 20:51:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1852 transitions. [2022-07-22 20:51:12,421 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1852 transitions. Word has length 69 [2022-07-22 20:51:12,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:12,421 INFO L495 AbstractCegarLoop]: Abstraction has 1384 states and 1852 transitions. [2022-07-22 20:51:12,422 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-22 20:51:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1852 transitions. [2022-07-22 20:51:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 20:51:12,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:12,423 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-22 20:51:12,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 20:51:12,423 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:12,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:12,423 INFO L85 PathProgramCache]: Analyzing trace with hash 251223467, now seen corresponding path program 1 times [2022-07-22 20:51:12,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:12,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345382816] [2022-07-22 20:51:12,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:12,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:12,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:12,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:12,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:12,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:12,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:12,473 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-22 20:51:12,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:12,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345382816] [2022-07-22 20:51:12,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345382816] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:12,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:12,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:51:12,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875460320] [2022-07-22 20:51:12,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:12,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:51:12,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:12,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:51:12,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:51:12,475 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-22 20:51:13,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:13,165 INFO L93 Difference]: Finished difference Result 2178 states and 3027 transitions. [2022-07-22 20:51:13,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 20:51:13,166 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-22 20:51:13,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:13,173 INFO L225 Difference]: With dead ends: 2178 [2022-07-22 20:51:13,174 INFO L226 Difference]: Without dead ends: 1819 [2022-07-22 20:51:13,175 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-22 20:51:13,175 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-22 20:51:13,177 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-22 20:51:13,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1819 states. [2022-07-22 20:51:13,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1819 to 1593. [2022-07-22 20:51:13,248 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-22 20:51:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2153 transitions. [2022-07-22 20:51:13,253 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2153 transitions. Word has length 69 [2022-07-22 20:51:13,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:13,253 INFO L495 AbstractCegarLoop]: Abstraction has 1593 states and 2153 transitions. [2022-07-22 20:51:13,253 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-22 20:51:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2153 transitions. [2022-07-22 20:51:13,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 20:51:13,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:13,255 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-22 20:51:13,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 20:51:13,255 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:13,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1789563497, now seen corresponding path program 1 times [2022-07-22 20:51:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:13,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450003100] [2022-07-22 20:51:13,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:13,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:13,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:13,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:13,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:13,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:13,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:13,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:13,310 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-22 20:51:13,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:13,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450003100] [2022-07-22 20:51:13,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450003100] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:13,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:13,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:51:13,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567651170] [2022-07-22 20:51:13,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:13,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:51:13,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:13,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:51:13,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:51:13,312 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-22 20:51:14,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:14,035 INFO L93 Difference]: Finished difference Result 2881 states and 4034 transitions. [2022-07-22 20:51:14,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-22 20:51:14,036 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-22 20:51:14,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:14,044 INFO L225 Difference]: With dead ends: 2881 [2022-07-22 20:51:14,044 INFO L226 Difference]: Without dead ends: 2313 [2022-07-22 20:51:14,046 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-22 20:51:14,048 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-22 20:51:14,048 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-22 20:51:14,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2313 states. [2022-07-22 20:51:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2313 to 2024. [2022-07-22 20:51:14,114 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-22 20:51:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2785 transitions. [2022-07-22 20:51:14,119 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2785 transitions. Word has length 69 [2022-07-22 20:51:14,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:14,119 INFO L495 AbstractCegarLoop]: Abstraction has 2024 states and 2785 transitions. [2022-07-22 20:51:14,119 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-22 20:51:14,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2785 transitions. [2022-07-22 20:51:14,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 20:51:14,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:14,121 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-22 20:51:14,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-22 20:51:14,121 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:14,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:14,121 INFO L85 PathProgramCache]: Analyzing trace with hash -239022613, now seen corresponding path program 1 times [2022-07-22 20:51:14,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:14,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020020123] [2022-07-22 20:51:14,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:14,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,194 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-22 20:51:14,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:14,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020020123] [2022-07-22 20:51:14,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020020123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:14,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:14,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:51:14,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778244341] [2022-07-22 20:51:14,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:14,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:51:14,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:14,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:51:14,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:51:14,196 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-22 20:51:14,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:14,803 INFO L93 Difference]: Finished difference Result 3560 states and 5064 transitions. [2022-07-22 20:51:14,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 20:51:14,804 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-22 20:51:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:14,812 INFO L225 Difference]: With dead ends: 3560 [2022-07-22 20:51:14,812 INFO L226 Difference]: Without dead ends: 2562 [2022-07-22 20:51:14,815 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-22 20:51:14,815 INFO L413 NwaCegarLoop]: 330 mSDtfsCounter, 376 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-22 20:51:14,816 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-22 20:51:14,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2562 states. [2022-07-22 20:51:14,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2562 to 2051. [2022-07-22 20:51:14,904 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-22 20:51:14,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2051 states to 2051 states and 2812 transitions. [2022-07-22 20:51:14,909 INFO L78 Accepts]: Start accepts. Automaton has 2051 states and 2812 transitions. Word has length 69 [2022-07-22 20:51:14,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:14,909 INFO L495 AbstractCegarLoop]: Abstraction has 2051 states and 2812 transitions. [2022-07-22 20:51:14,909 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-22 20:51:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2051 states and 2812 transitions. [2022-07-22 20:51:14,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-22 20:51:14,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:14,911 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-22 20:51:14,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-22 20:51:14,912 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:14,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:14,912 INFO L85 PathProgramCache]: Analyzing trace with hash 9123881, now seen corresponding path program 1 times [2022-07-22 20:51:14,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:14,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552660828] [2022-07-22 20:51:14,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:14,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:14,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:15,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:15,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:15,005 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-22 20:51:15,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:15,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552660828] [2022-07-22 20:51:15,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552660828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:15,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:15,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:51:15,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477357428] [2022-07-22 20:51:15,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:15,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:51:15,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:15,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:51:15,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:51:15,008 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-22 20:51:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:16,103 INFO L93 Difference]: Finished difference Result 5545 states and 8068 transitions. [2022-07-22 20:51:16,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 20:51:16,103 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-22 20:51:16,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:16,119 INFO L225 Difference]: With dead ends: 5545 [2022-07-22 20:51:16,119 INFO L226 Difference]: Without dead ends: 4520 [2022-07-22 20:51:16,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-07-22 20:51:16,125 INFO L413 NwaCegarLoop]: 500 mSDtfsCounter, 1435 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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-22 20:51:16,125 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-22 20:51:16,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4520 states. [2022-07-22 20:51:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4520 to 3969. [2022-07-22 20:51:16,338 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-22 20:51:16,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3969 states to 3969 states and 5575 transitions. [2022-07-22 20:51:16,347 INFO L78 Accepts]: Start accepts. Automaton has 3969 states and 5575 transitions. Word has length 69 [2022-07-22 20:51:16,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:16,348 INFO L495 AbstractCegarLoop]: Abstraction has 3969 states and 5575 transitions. [2022-07-22 20:51:16,348 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-22 20:51:16,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3969 states and 5575 transitions. [2022-07-22 20:51:16,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-22 20:51:16,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:16,351 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-22 20:51:16,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-22 20:51:16,352 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:16,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:16,352 INFO L85 PathProgramCache]: Analyzing trace with hash -411543486, now seen corresponding path program 1 times [2022-07-22 20:51:16,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:16,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316371017] [2022-07-22 20:51:16,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:16,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 20:51:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 20:51:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 20:51:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:16,450 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-22 20:51:16,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:16,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316371017] [2022-07-22 20:51:16,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316371017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:16,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:16,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 20:51:16,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370944260] [2022-07-22 20:51:16,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:16,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 20:51:16,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:16,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 20:51:16,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:51:16,452 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-22 20:51:17,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:17,089 INFO L93 Difference]: Finished difference Result 5146 states and 7126 transitions. [2022-07-22 20:51:17,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 20:51:17,090 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-22 20:51:17,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:17,103 INFO L225 Difference]: With dead ends: 5146 [2022-07-22 20:51:17,103 INFO L226 Difference]: Without dead ends: 4140 [2022-07-22 20:51:17,106 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-22 20:51:17,106 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 258 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:17,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1533 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-22 20:51:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4140 states. [2022-07-22 20:51:17,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4140 to 4009. [2022-07-22 20:51:17,288 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-22 20:51:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 5612 transitions. [2022-07-22 20:51:17,296 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 5612 transitions. Word has length 91 [2022-07-22 20:51:17,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:17,296 INFO L495 AbstractCegarLoop]: Abstraction has 4009 states and 5612 transitions. [2022-07-22 20:51:17,296 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-22 20:51:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 5612 transitions. [2022-07-22 20:51:17,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-22 20:51:17,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:17,299 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-22 20:51:17,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-22 20:51:17,299 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:17,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:17,300 INFO L85 PathProgramCache]: Analyzing trace with hash 32357188, now seen corresponding path program 1 times [2022-07-22 20:51:17,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:17,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227908647] [2022-07-22 20:51:17,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:17,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:17,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 20:51:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 20:51:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 20:51:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:17,382 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-22 20:51:17,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:17,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227908647] [2022-07-22 20:51:17,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227908647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:17,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:17,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 20:51:17,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845364617] [2022-07-22 20:51:17,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:17,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 20:51:17,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:17,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 20:51:17,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:17,384 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-22 20:51:18,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:18,241 INFO L93 Difference]: Finished difference Result 6047 states and 8217 transitions. [2022-07-22 20:51:18,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 20:51:18,245 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-22 20:51:18,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:18,287 INFO L225 Difference]: With dead ends: 6047 [2022-07-22 20:51:18,288 INFO L226 Difference]: Without dead ends: 5002 [2022-07-22 20:51:18,292 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-22 20:51:18,292 INFO L413 NwaCegarLoop]: 373 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, 1303 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-22 20:51:18,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1303 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-22 20:51:18,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5002 states. [2022-07-22 20:51:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5002 to 4686. [2022-07-22 20:51:18,527 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-22 20:51:18,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4686 states to 4686 states and 6465 transitions. [2022-07-22 20:51:18,536 INFO L78 Accepts]: Start accepts. Automaton has 4686 states and 6465 transitions. Word has length 91 [2022-07-22 20:51:18,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:18,536 INFO L495 AbstractCegarLoop]: Abstraction has 4686 states and 6465 transitions. [2022-07-22 20:51:18,537 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-22 20:51:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 4686 states and 6465 transitions. [2022-07-22 20:51:18,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-22 20:51:18,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:18,539 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-22 20:51:18,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-22 20:51:18,539 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:18,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:18,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1971519234, now seen corresponding path program 1 times [2022-07-22 20:51:18,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:18,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976828869] [2022-07-22 20:51:18,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:18,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 20:51:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 20:51:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 20:51:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:18,590 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-22 20:51:18,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:18,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976828869] [2022-07-22 20:51:18,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976828869] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:18,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:18,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:51:18,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460617614] [2022-07-22 20:51:18,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:18,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:51:18,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:51:18,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:51:18,592 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-22 20:51:19,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:19,138 INFO L93 Difference]: Finished difference Result 8345 states and 11247 transitions. [2022-07-22 20:51:19,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 20:51:19,139 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-22 20:51:19,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:19,160 INFO L225 Difference]: With dead ends: 8345 [2022-07-22 20:51:19,160 INFO L226 Difference]: Without dead ends: 6625 [2022-07-22 20:51:19,164 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-22 20:51:19,165 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 757 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:19,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 888 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-22 20:51:19,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2022-07-22 20:51:19,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 6405. [2022-07-22 20:51:19,460 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-22 20:51:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 8661 transitions. [2022-07-22 20:51:19,475 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 8661 transitions. Word has length 91 [2022-07-22 20:51:19,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:19,476 INFO L495 AbstractCegarLoop]: Abstraction has 6405 states and 8661 transitions. [2022-07-22 20:51:19,476 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-22 20:51:19,476 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 8661 transitions. [2022-07-22 20:51:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-22 20:51:19,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:19,480 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-22 20:51:19,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-22 20:51:19,480 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:19,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:19,481 INFO L85 PathProgramCache]: Analyzing trace with hash 913681156, now seen corresponding path program 1 times [2022-07-22 20:51:19,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:19,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355512536] [2022-07-22 20:51:19,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:19,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 20:51:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 20:51:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-22 20:51:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:19,526 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-22 20:51:19,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:19,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355512536] [2022-07-22 20:51:19,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355512536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:19,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:19,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 20:51:19,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442691961] [2022-07-22 20:51:19,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:19,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 20:51:19,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:19,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 20:51:19,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:51:19,528 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-22 20:51:19,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:19,895 INFO L93 Difference]: Finished difference Result 8243 states and 10964 transitions. [2022-07-22 20:51:19,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 20:51:19,896 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-22 20:51:19,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:19,908 INFO L225 Difference]: With dead ends: 8243 [2022-07-22 20:51:19,909 INFO L226 Difference]: Without dead ends: 4804 [2022-07-22 20:51:19,916 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-22 20:51:19,917 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-22 20:51:19,917 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-22 20:51:19,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4804 states. [2022-07-22 20:51:20,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4804 to 4686. [2022-07-22 20:51:20,151 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-22 20:51:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4686 states to 4686 states and 6422 transitions. [2022-07-22 20:51:20,162 INFO L78 Accepts]: Start accepts. Automaton has 4686 states and 6422 transitions. Word has length 91 [2022-07-22 20:51:20,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:20,162 INFO L495 AbstractCegarLoop]: Abstraction has 4686 states and 6422 transitions. [2022-07-22 20:51:20,162 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-22 20:51:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 4686 states and 6422 transitions. [2022-07-22 20:51:20,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-22 20:51:20,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:20,166 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-22 20:51:20,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 20:51:20,166 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:20,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1870290611, now seen corresponding path program 1 times [2022-07-22 20:51:20,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:20,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810761832] [2022-07-22 20:51:20,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:20,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:20,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 20:51:20,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 20:51:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 20:51:20,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:20,243 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-22 20:51:20,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:20,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810761832] [2022-07-22 20:51:20,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810761832] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:20,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:20,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-22 20:51:20,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458403919] [2022-07-22 20:51:20,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:20,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 20:51:20,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:20,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 20:51:20,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-22 20:51:20,247 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-22 20:51:21,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:21,411 INFO L93 Difference]: Finished difference Result 7512 states and 10024 transitions. [2022-07-22 20:51:21,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-22 20:51:21,411 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-22 20:51:21,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:21,422 INFO L225 Difference]: With dead ends: 7512 [2022-07-22 20:51:21,423 INFO L226 Difference]: Without dead ends: 5485 [2022-07-22 20:51:21,426 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-22 20:51:21,427 INFO L413 NwaCegarLoop]: 406 mSDtfsCounter, 1774 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:21,427 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.7s Time] [2022-07-22 20:51:21,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5485 states. [2022-07-22 20:51:21,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5485 to 5308. [2022-07-22 20:51:21,619 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-22 20:51:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5308 states to 5308 states and 7164 transitions. [2022-07-22 20:51:21,629 INFO L78 Accepts]: Start accepts. Automaton has 5308 states and 7164 transitions. Word has length 92 [2022-07-22 20:51:21,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:21,629 INFO L495 AbstractCegarLoop]: Abstraction has 5308 states and 7164 transitions. [2022-07-22 20:51:21,629 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-22 20:51:21,629 INFO L276 IsEmpty]: Start isEmpty. Operand 5308 states and 7164 transitions. [2022-07-22 20:51:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-22 20:51:21,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:21,634 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-22 20:51:21,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-22 20:51:21,634 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:21,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:21,634 INFO L85 PathProgramCache]: Analyzing trace with hash 56705439, now seen corresponding path program 1 times [2022-07-22 20:51:21,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:21,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018069065] [2022-07-22 20:51:21,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:21,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 20:51:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-22 20:51:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,700 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-22 20:51:21,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:21,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018069065] [2022-07-22 20:51:21,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018069065] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:21,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149469396] [2022-07-22 20:51:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:21,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:21,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:21,739 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-22 20:51:21,787 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-22 20:51:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:21,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:51:21,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:21,947 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-22 20:51:21,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:21,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149469396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:21,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:21,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:51:21,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348219105] [2022-07-22 20:51:21,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:21,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:51:21,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:21,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:51:21,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:21,950 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-22 20:51:22,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:22,243 INFO L93 Difference]: Finished difference Result 11026 states and 15472 transitions. [2022-07-22 20:51:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:51:22,244 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-22 20:51:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:22,255 INFO L225 Difference]: With dead ends: 11026 [2022-07-22 20:51:22,255 INFO L226 Difference]: Without dead ends: 5838 [2022-07-22 20:51:22,264 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-22 20:51:22,265 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-22 20:51:22,265 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-22 20:51:22,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5838 states. [2022-07-22 20:51:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5838 to 5838. [2022-07-22 20:51:22,456 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-22 20:51:22,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5838 states to 5838 states and 7921 transitions. [2022-07-22 20:51:22,465 INFO L78 Accepts]: Start accepts. Automaton has 5838 states and 7921 transitions. Word has length 111 [2022-07-22 20:51:22,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:22,466 INFO L495 AbstractCegarLoop]: Abstraction has 5838 states and 7921 transitions. [2022-07-22 20:51:22,466 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-22 20:51:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 5838 states and 7921 transitions. [2022-07-22 20:51:22,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-22 20:51:22,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:22,472 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-22 20:51:22,495 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-22 20:51:22,687 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-22 20:51:22,687 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:22,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:22,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1296496829, now seen corresponding path program 1 times [2022-07-22 20:51:22,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:22,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820773495] [2022-07-22 20:51:22,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:22,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 20:51:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-22 20:51:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 20:51:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,748 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-22 20:51:22,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:22,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820773495] [2022-07-22 20:51:22,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820773495] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:22,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057105980] [2022-07-22 20:51:22,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:22,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:22,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:22,750 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-22 20:51:22,810 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-22 20:51:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:22,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:51:22,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:22,966 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-22 20:51:22,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:22,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057105980] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:22,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:22,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-22 20:51:22,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542250185] [2022-07-22 20:51:22,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:22,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:51:22,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:22,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:51:22,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:22,968 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-22 20:51:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:23,244 INFO L93 Difference]: Finished difference Result 12594 states and 17806 transitions. [2022-07-22 20:51:23,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:51:23,244 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-22 20:51:23,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:23,263 INFO L225 Difference]: With dead ends: 12594 [2022-07-22 20:51:23,263 INFO L226 Difference]: Without dead ends: 9121 [2022-07-22 20:51:23,273 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-22 20:51:23,274 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-22 20:51:23,274 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-22 20:51:23,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9121 states. [2022-07-22 20:51:23,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9121 to 9051. [2022-07-22 20:51:23,703 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-22 20:51:23,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9051 states to 9051 states and 12505 transitions. [2022-07-22 20:51:23,721 INFO L78 Accepts]: Start accepts. Automaton has 9051 states and 12505 transitions. Word has length 143 [2022-07-22 20:51:23,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:23,721 INFO L495 AbstractCegarLoop]: Abstraction has 9051 states and 12505 transitions. [2022-07-22 20:51:23,721 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-22 20:51:23,721 INFO L276 IsEmpty]: Start isEmpty. Operand 9051 states and 12505 transitions. [2022-07-22 20:51:23,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-22 20:51:23,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:23,732 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-22 20:51:23,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-22 20:51:23,948 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-22 20:51:23,949 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:23,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:23,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2080420097, now seen corresponding path program 1 times [2022-07-22 20:51:23,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:23,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127896842] [2022-07-22 20:51:23,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:23,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:23,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:23,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:23,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 20:51:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-22 20:51:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 20:51:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,023 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-22 20:51:24,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:24,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127896842] [2022-07-22 20:51:24,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127896842] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:24,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353759583] [2022-07-22 20:51:24,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:24,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:24,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:24,040 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-22 20:51:24,083 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-22 20:51:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:24,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:51:24,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:24,292 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-22 20:51:24,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:24,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353759583] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:24,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:24,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-07-22 20:51:24,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133252087] [2022-07-22 20:51:24,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:24,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:51:24,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:24,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:51:24,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:24,295 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-22 20:51:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:24,752 INFO L93 Difference]: Finished difference Result 16387 states and 23265 transitions. [2022-07-22 20:51:24,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:51:24,753 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-22 20:51:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:24,778 INFO L225 Difference]: With dead ends: 16387 [2022-07-22 20:51:24,778 INFO L226 Difference]: Without dead ends: 12177 [2022-07-22 20:51:24,790 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-22 20:51:24,791 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-22 20:51:24,791 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-22 20:51:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2022-07-22 20:51:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 12077. [2022-07-22 20:51:25,220 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-22 20:51:25,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12077 states to 12077 states and 16826 transitions. [2022-07-22 20:51:25,245 INFO L78 Accepts]: Start accepts. Automaton has 12077 states and 16826 transitions. Word has length 143 [2022-07-22 20:51:25,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:25,246 INFO L495 AbstractCegarLoop]: Abstraction has 12077 states and 16826 transitions. [2022-07-22 20:51:25,246 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-22 20:51:25,246 INFO L276 IsEmpty]: Start isEmpty. Operand 12077 states and 16826 transitions. [2022-07-22 20:51:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-22 20:51:25,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:25,259 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-22 20:51:25,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-22 20:51:25,476 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-22 20:51:25,476 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:25,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:25,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1194272178, now seen corresponding path program 1 times [2022-07-22 20:51:25,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:25,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309330851] [2022-07-22 20:51:25,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:25,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:25,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:51:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:51:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 20:51:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 20:51:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 20:51:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 20:51:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-22 20:51:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:51:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:51:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:51:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-22 20:51:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-22 20:51:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-22 20:51:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-22 20:51:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,559 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-22 20:51:25,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:25,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309330851] [2022-07-22 20:51:25,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309330851] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:25,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702015892] [2022-07-22 20:51:25,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:25,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:25,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:25,580 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-22 20:51:25,581 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-22 20:51:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:25,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:51:25,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:25,759 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-22 20:51:25,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:25,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702015892] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:25,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:25,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-22 20:51:25,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623084967] [2022-07-22 20:51:25,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:25,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:51:25,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:25,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:51:25,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:51:25,763 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-22 20:51:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:26,274 INFO L93 Difference]: Finished difference Result 16402 states and 22141 transitions. [2022-07-22 20:51:26,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:51:26,274 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-22 20:51:26,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:26,305 INFO L225 Difference]: With dead ends: 16402 [2022-07-22 20:51:26,306 INFO L226 Difference]: Without dead ends: 14214 [2022-07-22 20:51:26,314 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-22 20:51:26,315 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-22 20:51:26,316 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-22 20:51:26,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14214 states. [2022-07-22 20:51:26,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14214 to 14169. [2022-07-22 20:51:26,899 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-22 20:51:26,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14169 states to 14169 states and 19315 transitions. [2022-07-22 20:51:26,928 INFO L78 Accepts]: Start accepts. Automaton has 14169 states and 19315 transitions. Word has length 163 [2022-07-22 20:51:26,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:26,929 INFO L495 AbstractCegarLoop]: Abstraction has 14169 states and 19315 transitions. [2022-07-22 20:51:26,929 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-22 20:51:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 14169 states and 19315 transitions. [2022-07-22 20:51:26,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-22 20:51:26,941 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:26,942 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-22 20:51:26,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-22 20:51:27,155 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-22 20:51:27,156 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:27,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:27,156 INFO L85 PathProgramCache]: Analyzing trace with hash 746982758, now seen corresponding path program 1 times [2022-07-22 20:51:27,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:27,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788125835] [2022-07-22 20:51:27,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:27,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:27,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:27,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:27,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:27,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:27,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:27,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 20:51:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:27,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 20:51:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:27,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:27,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-22 20:51:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:27,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:27,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-22 20:51:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:27,223 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-22 20:51:27,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:27,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788125835] [2022-07-22 20:51:27,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788125835] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:27,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99070805] [2022-07-22 20:51:27,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:27,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:27,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:27,225 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-22 20:51:27,226 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-22 20:51:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:27,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:51:27,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:27,385 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-22 20:51:27,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:27,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99070805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:27,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:27,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:51:27,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306213399] [2022-07-22 20:51:27,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:27,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:51:27,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:27,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:51:27,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:27,388 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-22 20:51:28,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:28,082 INFO L93 Difference]: Finished difference Result 22989 states and 31923 transitions. [2022-07-22 20:51:28,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:51:28,082 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-22 20:51:28,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:28,119 INFO L225 Difference]: With dead ends: 22989 [2022-07-22 20:51:28,120 INFO L226 Difference]: Without dead ends: 13278 [2022-07-22 20:51:28,145 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-22 20:51:28,146 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-22 20:51:28,146 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-22 20:51:28,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13278 states. [2022-07-22 20:51:28,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13278 to 13278. [2022-07-22 20:51:28,923 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-22 20:51:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13278 states to 13278 states and 17485 transitions. [2022-07-22 20:51:28,944 INFO L78 Accepts]: Start accepts. Automaton has 13278 states and 17485 transitions. Word has length 160 [2022-07-22 20:51:28,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:28,944 INFO L495 AbstractCegarLoop]: Abstraction has 13278 states and 17485 transitions. [2022-07-22 20:51:28,945 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-22 20:51:28,945 INFO L276 IsEmpty]: Start isEmpty. Operand 13278 states and 17485 transitions. [2022-07-22 20:51:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-07-22 20:51:28,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:28,956 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-22 20:51:28,973 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-22 20:51:29,172 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-22 20:51:29,172 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:29,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:29,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1605594576, now seen corresponding path program 1 times [2022-07-22 20:51:29,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:29,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621093803] [2022-07-22 20:51:29,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:29,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:29,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:29,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:29,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:29,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:29,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:29,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-22 20:51:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:29,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-22 20:51:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:29,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:29,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-22 20:51:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:29,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:29,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-22 20:51:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:29,231 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-22 20:51:29,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:29,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621093803] [2022-07-22 20:51:29,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621093803] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:29,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074857160] [2022-07-22 20:51:29,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:29,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:29,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:29,233 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-22 20:51:29,234 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-22 20:51:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:29,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 20:51:29,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:29,327 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-22 20:51:29,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:29,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074857160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:29,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:29,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:51:29,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584553919] [2022-07-22 20:51:29,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:29,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:51:29,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:29,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:51:29,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:29,329 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-22 20:51:29,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:29,960 INFO L93 Difference]: Finished difference Result 22874 states and 30536 transitions. [2022-07-22 20:51:29,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:51:29,960 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-22 20:51:29,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:29,985 INFO L225 Difference]: With dead ends: 22874 [2022-07-22 20:51:29,985 INFO L226 Difference]: Without dead ends: 14054 [2022-07-22 20:51:29,995 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-22 20:51:29,995 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-22 20:51:29,995 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-22 20:51:30,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14054 states. [2022-07-22 20:51:30,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14054 to 13909. [2022-07-22 20:51:30,576 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-22 20:51:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13909 states to 13909 states and 17990 transitions. [2022-07-22 20:51:30,601 INFO L78 Accepts]: Start accepts. Automaton has 13909 states and 17990 transitions. Word has length 160 [2022-07-22 20:51:30,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:30,602 INFO L495 AbstractCegarLoop]: Abstraction has 13909 states and 17990 transitions. [2022-07-22 20:51:30,602 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-22 20:51:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 13909 states and 17990 transitions. [2022-07-22 20:51:30,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-22 20:51:30,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:30,613 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-22 20:51:30,630 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-22 20:51:30,829 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-22 20:51:30,829 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:30,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:30,829 INFO L85 PathProgramCache]: Analyzing trace with hash 522982663, now seen corresponding path program 1 times [2022-07-22 20:51:30,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:30,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957447925] [2022-07-22 20:51:30,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:30,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:30,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:30,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:30,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:30,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:30,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:30,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 20:51:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:30,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:30,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-22 20:51:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:30,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-22 20:51:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:30,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:30,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-22 20:51:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:30,896 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-22 20:51:30,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:30,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957447925] [2022-07-22 20:51:30,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957447925] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:30,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678245826] [2022-07-22 20:51:30,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:30,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:30,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:30,898 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-22 20:51:30,899 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-22 20:51:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:30,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:51:30,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:31,014 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-22 20:51:31,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:31,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678245826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:31,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:31,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:51:31,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976486113] [2022-07-22 20:51:31,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:31,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:51:31,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:31,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:51:31,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:31,017 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-22 20:51:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:31,985 INFO L93 Difference]: Finished difference Result 31048 states and 41157 transitions. [2022-07-22 20:51:31,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:51:31,986 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-22 20:51:31,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:32,030 INFO L225 Difference]: With dead ends: 31048 [2022-07-22 20:51:32,030 INFO L226 Difference]: Without dead ends: 21597 [2022-07-22 20:51:32,045 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-22 20:51:32,046 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-22 20:51:32,046 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-22 20:51:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21597 states. [2022-07-22 20:51:33,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21597 to 21593. [2022-07-22 20:51:33,125 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-22 20:51:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21593 states to 21593 states and 28422 transitions. [2022-07-22 20:51:33,171 INFO L78 Accepts]: Start accepts. Automaton has 21593 states and 28422 transitions. Word has length 161 [2022-07-22 20:51:33,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:33,171 INFO L495 AbstractCegarLoop]: Abstraction has 21593 states and 28422 transitions. [2022-07-22 20:51:33,171 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-22 20:51:33,171 INFO L276 IsEmpty]: Start isEmpty. Operand 21593 states and 28422 transitions. [2022-07-22 20:51:33,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-22 20:51:33,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:33,189 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-22 20:51:33,210 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-22 20:51:33,407 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-22 20:51:33,408 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:33,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:33,408 INFO L85 PathProgramCache]: Analyzing trace with hash 675676757, now seen corresponding path program 1 times [2022-07-22 20:51:33,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:33,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250391093] [2022-07-22 20:51:33,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:33,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:33,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:33,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:33,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:33,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:33,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:33,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 20:51:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:33,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 20:51:33,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:33,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:33,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-22 20:51:33,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:33,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:33,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-22 20:51:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:33,484 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-22 20:51:33,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:33,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250391093] [2022-07-22 20:51:33,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250391093] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:33,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768870826] [2022-07-22 20:51:33,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:33,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:33,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:33,486 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-22 20:51:33,517 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-22 20:51:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:33,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 20:51:33,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:33,624 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-22 20:51:33,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:33,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768870826] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:33,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:33,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:51:33,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505419621] [2022-07-22 20:51:33,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:33,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:51:33,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:33,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:51:33,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:33,626 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-22 20:51:35,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:35,459 INFO L93 Difference]: Finished difference Result 55172 states and 74382 transitions. [2022-07-22 20:51:35,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:51:35,459 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-22 20:51:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:35,543 INFO L225 Difference]: With dead ends: 55172 [2022-07-22 20:51:35,543 INFO L226 Difference]: Without dead ends: 38041 [2022-07-22 20:51:35,575 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-22 20:51:35,575 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-22 20:51:35,576 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-22 20:51:35,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38041 states. [2022-07-22 20:51:37,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38041 to 37835. [2022-07-22 20:51:37,473 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-22 20:51:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37835 states to 37835 states and 50841 transitions. [2022-07-22 20:51:37,554 INFO L78 Accepts]: Start accepts. Automaton has 37835 states and 50841 transitions. Word has length 161 [2022-07-22 20:51:37,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:37,554 INFO L495 AbstractCegarLoop]: Abstraction has 37835 states and 50841 transitions. [2022-07-22 20:51:37,554 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-22 20:51:37,554 INFO L276 IsEmpty]: Start isEmpty. Operand 37835 states and 50841 transitions. [2022-07-22 20:51:37,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-22 20:51:37,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:37,586 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-22 20:51:37,604 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-22 20:51:37,803 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-22 20:51:37,803 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:37,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:37,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1567842387, now seen corresponding path program 1 times [2022-07-22 20:51:37,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:37,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595856224] [2022-07-22 20:51:37,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:37,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:37,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:37,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:37,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:37,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:37,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:37,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-22 20:51:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:37,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 20:51:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:37,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:37,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-22 20:51:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:37,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:37,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-22 20:51:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:37,842 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-22 20:51:37,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:37,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595856224] [2022-07-22 20:51:37,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595856224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:37,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:51:37,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 20:51:37,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923664452] [2022-07-22 20:51:37,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:37,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:51:37,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:37,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:51:37,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 20:51:37,844 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-22 20:51:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:39,791 INFO L93 Difference]: Finished difference Result 67330 states and 90844 transitions. [2022-07-22 20:51:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 20:51:39,792 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-22 20:51:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:39,873 INFO L225 Difference]: With dead ends: 67330 [2022-07-22 20:51:39,873 INFO L226 Difference]: Without dead ends: 33955 [2022-07-22 20:51:39,920 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-22 20:51:39,921 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-22 20:51:39,921 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-22 20:51:39,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33955 states. [2022-07-22 20:51:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33955 to 31775. [2022-07-22 20:51:41,942 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-22 20:51:41,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31775 states to 31775 states and 42442 transitions. [2022-07-22 20:51:42,000 INFO L78 Accepts]: Start accepts. Automaton has 31775 states and 42442 transitions. Word has length 161 [2022-07-22 20:51:42,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:42,000 INFO L495 AbstractCegarLoop]: Abstraction has 31775 states and 42442 transitions. [2022-07-22 20:51:42,001 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-22 20:51:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 31775 states and 42442 transitions. [2022-07-22 20:51:42,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-22 20:51:42,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:42,026 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-22 20:51:42,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-22 20:51:42,027 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:42,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:42,027 INFO L85 PathProgramCache]: Analyzing trace with hash -423691555, now seen corresponding path program 1 times [2022-07-22 20:51:42,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:42,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292554221] [2022-07-22 20:51:42,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:42,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:42,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:42,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:42,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:42,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:42,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:42,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:51:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:42,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:51:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:42,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:42,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 20:51:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:42,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:42,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 20:51:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:42,089 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-22 20:51:42,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:42,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292554221] [2022-07-22 20:51:42,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292554221] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:42,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616343123] [2022-07-22 20:51:42,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:42,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:42,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:42,091 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-22 20:51:42,092 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-22 20:51:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:42,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 20:51:42,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:42,210 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-22 20:51:42,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:42,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616343123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:42,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:42,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:51:42,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954094595] [2022-07-22 20:51:42,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:42,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:51:42,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:42,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:51:42,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:42,212 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-22 20:51:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:43,723 INFO L93 Difference]: Finished difference Result 50520 states and 69980 transitions. [2022-07-22 20:51:43,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:51:43,724 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-22 20:51:43,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:43,796 INFO L225 Difference]: With dead ends: 50520 [2022-07-22 20:51:43,797 INFO L226 Difference]: Without dead ends: 31859 [2022-07-22 20:51:43,830 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-22 20:51:43,831 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-22 20:51:43,831 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-22 20:51:43,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31859 states. [2022-07-22 20:51:45,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31859 to 31775. [2022-07-22 20:51:45,884 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-22 20:51:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31775 states to 31775 states and 41871 transitions. [2022-07-22 20:51:45,973 INFO L78 Accepts]: Start accepts. Automaton has 31775 states and 41871 transitions. Word has length 163 [2022-07-22 20:51:45,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:45,974 INFO L495 AbstractCegarLoop]: Abstraction has 31775 states and 41871 transitions. [2022-07-22 20:51:45,974 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-22 20:51:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 31775 states and 41871 transitions. [2022-07-22 20:51:46,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-22 20:51:46,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:46,005 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-22 20:51:46,029 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-22 20:51:46,221 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-22 20:51:46,222 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:46,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:46,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1271742787, now seen corresponding path program 1 times [2022-07-22 20:51:46,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:46,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191564824] [2022-07-22 20:51:46,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:46,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:46,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:46,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:46,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:46,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:46,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:46,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:51:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:46,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:51:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:46,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:46,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 20:51:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:46,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:46,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-22 20:51:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:46,309 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-22 20:51:46,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:46,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191564824] [2022-07-22 20:51:46,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191564824] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:46,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895352077] [2022-07-22 20:51:46,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:46,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:46,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:46,311 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-22 20:51:46,313 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-22 20:51:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:46,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:51:46,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:46,475 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-22 20:51:46,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:46,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895352077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:46,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:46,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:51:46,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526354521] [2022-07-22 20:51:46,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:46,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:51:46,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:46,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:51:46,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:51:46,476 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-22 20:51:48,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:48,260 INFO L93 Difference]: Finished difference Result 54728 states and 74324 transitions. [2022-07-22 20:51:48,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:51:48,261 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-22 20:51:48,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:48,336 INFO L225 Difference]: With dead ends: 54728 [2022-07-22 20:51:48,336 INFO L226 Difference]: Without dead ends: 30957 [2022-07-22 20:51:48,371 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-22 20:51:48,371 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-22 20:51:48,372 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-22 20:51:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30957 states. [2022-07-22 20:51:49,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30957 to 22939. [2022-07-22 20:51:49,684 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-22 20:51:49,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22939 states to 22939 states and 28970 transitions. [2022-07-22 20:51:49,730 INFO L78 Accepts]: Start accepts. Automaton has 22939 states and 28970 transitions. Word has length 163 [2022-07-22 20:51:49,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:49,730 INFO L495 AbstractCegarLoop]: Abstraction has 22939 states and 28970 transitions. [2022-07-22 20:51:49,730 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-22 20:51:49,730 INFO L276 IsEmpty]: Start isEmpty. Operand 22939 states and 28970 transitions. [2022-07-22 20:51:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-22 20:51:49,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:49,743 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-22 20:51:49,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-22 20:51:49,950 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-22 20:51:49,950 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:49,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:49,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1192837573, now seen corresponding path program 1 times [2022-07-22 20:51:49,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:49,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289753175] [2022-07-22 20:51:49,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:49,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:49,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:49,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:49,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:50,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:50,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:50,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:51:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:50,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:51:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:50,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:50,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 20:51:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:50,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:50,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-22 20:51:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:50,034 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-22 20:51:50,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:50,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289753175] [2022-07-22 20:51:50,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289753175] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:50,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563461279] [2022-07-22 20:51:50,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:50,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:50,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:50,036 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-22 20:51:50,037 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-22 20:51:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:50,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 20:51:50,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:50,190 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-22 20:51:50,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:50,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563461279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:50,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:50,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-22 20:51:50,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418516326] [2022-07-22 20:51:50,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:50,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:51:50,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:50,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:51:50,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:51:50,192 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-22 20:51:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:51,795 INFO L93 Difference]: Finished difference Result 41372 states and 52881 transitions. [2022-07-22 20:51:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 20:51:51,796 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-22 20:51:51,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:51,843 INFO L225 Difference]: With dead ends: 41372 [2022-07-22 20:51:51,843 INFO L226 Difference]: Without dead ends: 22891 [2022-07-22 20:51:51,868 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-22 20:51:51,868 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.1s IncrementalHoareTripleChecker+Time [2022-07-22 20:51:51,868 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.1s Time] [2022-07-22 20:51:51,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22891 states. [2022-07-22 20:51:53,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22891 to 22891. [2022-07-22 20:51:53,316 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-22 20:51:53,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22891 states to 22891 states and 28442 transitions. [2022-07-22 20:51:53,356 INFO L78 Accepts]: Start accepts. Automaton has 22891 states and 28442 transitions. Word has length 165 [2022-07-22 20:51:53,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:53,356 INFO L495 AbstractCegarLoop]: Abstraction has 22891 states and 28442 transitions. [2022-07-22 20:51:53,357 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-22 20:51:53,357 INFO L276 IsEmpty]: Start isEmpty. Operand 22891 states and 28442 transitions. [2022-07-22 20:51:53,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-22 20:51:53,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:53,371 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-22 20:51:53,387 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-22 20:51:53,594 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-22 20:51:53,595 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:53,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:53,595 INFO L85 PathProgramCache]: Analyzing trace with hash 100202371, now seen corresponding path program 1 times [2022-07-22 20:51:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:53,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052984272] [2022-07-22 20:51:53,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:53,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:53,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:53,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:53,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:53,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:53,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:53,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:51:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:53,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:51:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:53,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:53,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 20:51:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:53,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:53,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-22 20:51:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:53,706 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-22 20:51:53,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:53,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052984272] [2022-07-22 20:51:53,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052984272] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:53,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769639085] [2022-07-22 20:51:53,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:53,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:53,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:53,708 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-22 20:51:53,709 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-22 20:51:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:53,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 569 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 20:51:53,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:53,863 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-22 20:51:53,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:53,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769639085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:53,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:53,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-07-22 20:51:53,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029060263] [2022-07-22 20:51:53,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:53,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:51:53,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:53,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:51:53,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 20:51:53,865 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-22 20:51:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:55,538 INFO L93 Difference]: Finished difference Result 40204 states and 51213 transitions. [2022-07-22 20:51:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 20:51:55,538 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-22 20:51:55,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:55,578 INFO L225 Difference]: With dead ends: 40204 [2022-07-22 20:51:55,578 INFO L226 Difference]: Without dead ends: 22497 [2022-07-22 20:51:55,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-22 20:51:55,600 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-22 20:51:55,600 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-22 20:51:55,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22497 states. [2022-07-22 20:51:56,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22497 to 20464. [2022-07-22 20:51:56,980 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-22 20:51:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20464 states to 20464 states and 24831 transitions. [2022-07-22 20:51:57,017 INFO L78 Accepts]: Start accepts. Automaton has 20464 states and 24831 transitions. Word has length 165 [2022-07-22 20:51:57,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:51:57,017 INFO L495 AbstractCegarLoop]: Abstraction has 20464 states and 24831 transitions. [2022-07-22 20:51:57,017 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-22 20:51:57,017 INFO L276 IsEmpty]: Start isEmpty. Operand 20464 states and 24831 transitions. [2022-07-22 20:51:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-22 20:51:57,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:51:57,027 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-22 20:51:57,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-22 20:51:57,233 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-22 20:51:57,233 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:51:57,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:51:57,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1742273343, now seen corresponding path program 1 times [2022-07-22 20:51:57,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:51:57,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469572680] [2022-07-22 20:51:57,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:57,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:51:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:57,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:51:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:57,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:51:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:57,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:51:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:57,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:51:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:57,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:51:57,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:57,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:51:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:57,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:51:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:57,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:57,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 20:51:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:57,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:51:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:57,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-22 20:51:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:57,346 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-22 20:51:57,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:51:57,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469572680] [2022-07-22 20:51:57,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469572680] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:51:57,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471208660] [2022-07-22 20:51:57,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:51:57,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:51:57,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:51:57,348 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-22 20:51:57,349 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-22 20:51:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:51:57,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 20:51:57,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:51:57,460 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-22 20:51:57,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:51:57,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471208660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:51:57,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:51:57,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-22 20:51:57,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400103445] [2022-07-22 20:51:57,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:51:57,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:51:57,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:51:57,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:51:57,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:51:57,463 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-22 20:51:58,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:51:58,833 INFO L93 Difference]: Finished difference Result 36204 states and 44667 transitions. [2022-07-22 20:51:58,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 20:51:58,835 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-22 20:51:58,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:51:58,877 INFO L225 Difference]: With dead ends: 36204 [2022-07-22 20:51:58,877 INFO L226 Difference]: Without dead ends: 20200 [2022-07-22 20:51:58,903 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-22 20:51:58,904 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-22 20:51:58,904 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-22 20:51:58,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20200 states. [2022-07-22 20:52:00,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20200 to 19820. [2022-07-22 20:52:00,175 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-22 20:52:00,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19820 states to 19820 states and 23711 transitions. [2022-07-22 20:52:00,211 INFO L78 Accepts]: Start accepts. Automaton has 19820 states and 23711 transitions. Word has length 165 [2022-07-22 20:52:00,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:52:00,211 INFO L495 AbstractCegarLoop]: Abstraction has 19820 states and 23711 transitions. [2022-07-22 20:52:00,211 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-22 20:52:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 19820 states and 23711 transitions. [2022-07-22 20:52:00,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-22 20:52:00,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:52:00,220 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-22 20:52:00,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-22 20:52:00,436 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-22 20:52:00,437 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:52:00,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:52:00,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1910661765, now seen corresponding path program 1 times [2022-07-22 20:52:00,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:52:00,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854241084] [2022-07-22 20:52:00,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:52:00,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:52:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:00,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:52:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:00,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:52:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:00,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:52:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:00,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:52:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:00,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:52:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:00,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-22 20:52:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:00,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:52:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:00,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:52:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:00,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-22 20:52:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:00,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:52:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:00,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-22 20:52:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:00,509 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-22 20:52:00,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:52:00,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854241084] [2022-07-22 20:52:00,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854241084] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:52:00,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70153750] [2022-07-22 20:52:00,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:52:00,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:52:00,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:52:00,511 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-22 20:52:00,512 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-22 20:52:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:00,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 20:52:00,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:52:00,615 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-22 20:52:00,615 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:52:00,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70153750] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:52:00,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:52:00,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-22 20:52:00,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030655473] [2022-07-22 20:52:00,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:52:00,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:52:00,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:52:00,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:52:00,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:52:00,617 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-22 20:52:01,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:52:01,978 INFO L93 Difference]: Finished difference Result 29556 states and 35690 transitions. [2022-07-22 20:52:01,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 20:52:01,979 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-22 20:52:01,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:52:02,009 INFO L225 Difference]: With dead ends: 29556 [2022-07-22 20:52:02,009 INFO L226 Difference]: Without dead ends: 14193 [2022-07-22 20:52:02,028 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-22 20:52:02,029 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-22 20:52:02,029 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-22 20:52:02,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14193 states. [2022-07-22 20:52:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14193 to 14137. [2022-07-22 20:52:02,925 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-22 20:52:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14137 states to 14137 states and 16707 transitions. [2022-07-22 20:52:02,949 INFO L78 Accepts]: Start accepts. Automaton has 14137 states and 16707 transitions. Word has length 165 [2022-07-22 20:52:02,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:52:02,949 INFO L495 AbstractCegarLoop]: Abstraction has 14137 states and 16707 transitions. [2022-07-22 20:52:02,950 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-22 20:52:02,950 INFO L276 IsEmpty]: Start isEmpty. Operand 14137 states and 16707 transitions. [2022-07-22 20:52:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-22 20:52:02,957 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:52:02,957 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-22 20:52:02,974 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-22 20:52:03,171 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-22 20:52:03,171 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:52:03,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:52:03,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1582737387, now seen corresponding path program 1 times [2022-07-22 20:52:03,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:52:03,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946676789] [2022-07-22 20:52:03,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:52:03,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:52:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:52:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:52:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:52:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:52:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:52:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 20:52:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 20:52:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 20:52:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 20:52:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-22 20:52:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:52:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:52:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:52:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-22 20:52:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-22 20:52:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-22 20:52:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:52:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:52:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-22 20:52:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-22 20:52:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,244 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-22 20:52:03,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:52:03,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946676789] [2022-07-22 20:52:03,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946676789] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:52:03,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163881026] [2022-07-22 20:52:03,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:52:03,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:52:03,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:52:03,310 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-22 20:52:03,339 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-22 20:52:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:03,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:52:03,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:52:03,569 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-22 20:52:03,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:52:03,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163881026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:52:03,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:52:03,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-22 20:52:03,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983182907] [2022-07-22 20:52:03,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:52:03,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:52:03,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:52:03,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:52:03,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:52:03,570 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-22 20:52:04,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:52:04,566 INFO L93 Difference]: Finished difference Result 23005 states and 27445 transitions. [2022-07-22 20:52:04,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:52:04,567 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-22 20:52:04,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:52:04,601 INFO L225 Difference]: With dead ends: 23005 [2022-07-22 20:52:04,601 INFO L226 Difference]: Without dead ends: 18571 [2022-07-22 20:52:04,613 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-22 20:52:04,614 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-22 20:52:04,614 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-22 20:52:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18571 states. [2022-07-22 20:52:05,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18571 to 18561. [2022-07-22 20:52:05,779 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-22 20:52:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18561 states to 18561 states and 22016 transitions. [2022-07-22 20:52:05,811 INFO L78 Accepts]: Start accepts. Automaton has 18561 states and 22016 transitions. Word has length 195 [2022-07-22 20:52:05,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:52:05,812 INFO L495 AbstractCegarLoop]: Abstraction has 18561 states and 22016 transitions. [2022-07-22 20:52:05,812 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-22 20:52:05,812 INFO L276 IsEmpty]: Start isEmpty. Operand 18561 states and 22016 transitions. [2022-07-22 20:52:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-07-22 20:52:05,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:52:05,820 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-22 20:52:05,837 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-22 20:52:06,027 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-22 20:52:06,027 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:52:06,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:52:06,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1814836631, now seen corresponding path program 1 times [2022-07-22 20:52:06,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:52:06,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169411384] [2022-07-22 20:52:06,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:52:06,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:52:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:52:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:52:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-22 20:52:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:52:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-22 20:52:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-22 20:52:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 20:52:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-22 20:52:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-22 20:52:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-22 20:52:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-22 20:52:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:52:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:52:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-22 20:52:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-22 20:52:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-22 20:52:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 20:52:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 20:52:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-22 20:52:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-22 20:52:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,158 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-22 20:52:06,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:52:06,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169411384] [2022-07-22 20:52:06,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169411384] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:52:06,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597472504] [2022-07-22 20:52:06,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:52:06,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:52:06,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:52:06,176 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-22 20:52:06,177 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-22 20:52:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:06,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:52:06,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:52:06,426 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-22 20:52:06,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:52:06,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597472504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:52:06,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:52:06,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-22 20:52:06,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188620793] [2022-07-22 20:52:06,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:52:06,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:52:06,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:52:06,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:52:06,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-22 20:52:06,429 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-22 20:52:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:52:07,551 INFO L93 Difference]: Finished difference Result 25091 states and 30256 transitions. [2022-07-22 20:52:07,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:52:07,551 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-22 20:52:07,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:52:07,570 INFO L225 Difference]: With dead ends: 25091 [2022-07-22 20:52:07,570 INFO L226 Difference]: Without dead ends: 9692 [2022-07-22 20:52:07,591 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-22 20:52:07,592 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-22 20:52:07,592 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-22 20:52:07,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9692 states. [2022-07-22 20:52:08,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9692 to 9692. [2022-07-22 20:52:08,257 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-22 20:52:08,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9692 states to 9692 states and 11319 transitions. [2022-07-22 20:52:08,272 INFO L78 Accepts]: Start accepts. Automaton has 9692 states and 11319 transitions. Word has length 195 [2022-07-22 20:52:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:52:08,273 INFO L495 AbstractCegarLoop]: Abstraction has 9692 states and 11319 transitions. [2022-07-22 20:52:08,273 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-22 20:52:08,273 INFO L276 IsEmpty]: Start isEmpty. Operand 9692 states and 11319 transitions. [2022-07-22 20:52:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-22 20:52:08,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:52:08,280 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-22 20:52:08,311 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-22 20:52:08,496 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-22 20:52:08,497 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:52:08,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:52:08,497 INFO L85 PathProgramCache]: Analyzing trace with hash -55403990, now seen corresponding path program 1 times [2022-07-22 20:52:08,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:52:08,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310767404] [2022-07-22 20:52:08,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:52:08,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:52:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:08,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:52:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:08,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:52:08,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:08,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:52:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:08,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:52:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:08,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:52:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:08,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-22 20:52:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:08,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:52:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:08,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-22 20:52:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:08,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-22 20:52:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:08,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:52:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:08,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-22 20:52:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:08,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:52:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:08,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-22 20:52:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:08,569 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-22 20:52:08,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:52:08,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310767404] [2022-07-22 20:52:08,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310767404] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:52:08,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327389141] [2022-07-22 20:52:08,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:52:08,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:52:08,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:52:08,578 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-22 20:52:08,580 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-22 20:52:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:08,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 20:52:08,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:52:08,690 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-22 20:52:08,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:52:08,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327389141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:52:08,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:52:08,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-07-22 20:52:08,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562698797] [2022-07-22 20:52:08,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:52:08,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:52:08,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:52:08,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:52:08,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 20:52:08,692 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-22 20:52:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:52:09,102 INFO L93 Difference]: Finished difference Result 12798 states and 14928 transitions. [2022-07-22 20:52:09,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:52:09,103 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-22 20:52:09,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:52:09,109 INFO L225 Difference]: With dead ends: 12798 [2022-07-22 20:52:09,109 INFO L226 Difference]: Without dead ends: 2922 [2022-07-22 20:52:09,118 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-22 20:52:09,118 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-22 20:52:09,119 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-22 20:52:09,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2022-07-22 20:52:09,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2922. [2022-07-22 20:52:09,302 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-22 20:52:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 3331 transitions. [2022-07-22 20:52:09,306 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 3331 transitions. Word has length 200 [2022-07-22 20:52:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:52:09,306 INFO L495 AbstractCegarLoop]: Abstraction has 2922 states and 3331 transitions. [2022-07-22 20:52:09,306 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-22 20:52:09,306 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3331 transitions. [2022-07-22 20:52:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-22 20:52:09,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:52:09,309 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-22 20:52:09,325 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-22 20:52:09,521 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-22 20:52:09,521 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:52:09,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:52:09,522 INFO L85 PathProgramCache]: Analyzing trace with hash 135104874, now seen corresponding path program 1 times [2022-07-22 20:52:09,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:52:09,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109641663] [2022-07-22 20:52:09,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:52:09,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:52:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:09,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:52:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:09,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:52:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:09,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:52:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:09,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:52:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:09,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:52:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:09,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 20:52:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:09,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 20:52:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:09,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:52:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:09,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:52:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:09,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:52:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:09,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-22 20:52:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:09,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:52:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:09,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-22 20:52:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:09,588 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-22 20:52:09,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:52:09,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109641663] [2022-07-22 20:52:09,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109641663] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 20:52:09,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688113282] [2022-07-22 20:52:09,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:52:09,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 20:52:09,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 20:52:09,603 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-22 20:52:09,604 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-22 20:52:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:09,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 20:52:09,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 20:52:09,737 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-22 20:52:09,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 20:52:09,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688113282] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:52:09,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 20:52:09,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-07-22 20:52:09,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262007057] [2022-07-22 20:52:09,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:52:09,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 20:52:09,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:52:09,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 20:52:09,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 20:52:09,739 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-22 20:52:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:52:09,928 INFO L93 Difference]: Finished difference Result 5145 states and 5903 transitions. [2022-07-22 20:52:09,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 20:52:09,928 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-22 20:52:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:52:09,933 INFO L225 Difference]: With dead ends: 5145 [2022-07-22 20:52:09,934 INFO L226 Difference]: Without dead ends: 2922 [2022-07-22 20:52:09,936 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-22 20:52:09,937 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-22 20:52:09,937 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-22 20:52:09,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states. [2022-07-22 20:52:10,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2922. [2022-07-22 20:52:10,116 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-22 20:52:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 3304 transitions. [2022-07-22 20:52:10,120 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 3304 transitions. Word has length 201 [2022-07-22 20:52:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:52:10,120 INFO L495 AbstractCegarLoop]: Abstraction has 2922 states and 3304 transitions. [2022-07-22 20:52:10,120 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-22 20:52:10,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 3304 transitions. [2022-07-22 20:52:10,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-22 20:52:10,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:52:10,123 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-22 20:52:10,141 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-22 20:52:10,340 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-22 20:52:10,341 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:52:10,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:52:10,341 INFO L85 PathProgramCache]: Analyzing trace with hash 171826558, now seen corresponding path program 1 times [2022-07-22 20:52:10,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:52:10,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96157062] [2022-07-22 20:52:10,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:52:10,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:52:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:10,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:52:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:10,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:52:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:10,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:52:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:10,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:52:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:10,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:52:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:10,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 20:52:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:10,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 20:52:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:10,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:52:10,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:10,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:52:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:10,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:52:10,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:10,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-22 20:52:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:10,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:52:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:10,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-22 20:52:10,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:10,444 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-22 20:52:10,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:52:10,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96157062] [2022-07-22 20:52:10,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96157062] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:52:10,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:52:10,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 20:52:10,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580185878] [2022-07-22 20:52:10,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:52:10,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 20:52:10,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:52:10,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 20:52:10,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 20:52:10,446 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-22 20:52:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:52:11,221 INFO L93 Difference]: Finished difference Result 3320 states and 3736 transitions. [2022-07-22 20:52:11,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-22 20:52:11,222 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-22 20:52:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:52:11,227 INFO L225 Difference]: With dead ends: 3320 [2022-07-22 20:52:11,227 INFO L226 Difference]: Without dead ends: 3317 [2022-07-22 20:52:11,228 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-22 20:52:11,228 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.4s IncrementalHoareTripleChecker+Time [2022-07-22 20:52:11,229 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.4s Time] [2022-07-22 20:52:11,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3317 states. [2022-07-22 20:52:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3317 to 3086. [2022-07-22 20:52:11,444 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-22 20:52:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 3488 transitions. [2022-07-22 20:52:11,448 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 3488 transitions. Word has length 203 [2022-07-22 20:52:11,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:52:11,448 INFO L495 AbstractCegarLoop]: Abstraction has 3086 states and 3488 transitions. [2022-07-22 20:52:11,448 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-22 20:52:11,448 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 3488 transitions. [2022-07-22 20:52:11,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-07-22 20:52:11,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:52:11,452 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-22 20:52:11,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-22 20:52:11,452 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:52:11,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:52:11,452 INFO L85 PathProgramCache]: Analyzing trace with hash -190863834, now seen corresponding path program 1 times [2022-07-22 20:52:11,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:52:11,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663817387] [2022-07-22 20:52:11,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:52:11,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:52:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:11,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 20:52:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:11,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-22 20:52:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:11,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-22 20:52:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:11,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 20:52:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:11,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 20:52:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:11,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-22 20:52:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:11,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-22 20:52:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:11,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:52:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:11,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-22 20:52:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:11,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:52:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:11,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-22 20:52:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:11,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 20:52:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:11,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-22 20:52:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 20:52:11,508 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-22 20:52:11,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 20:52:11,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663817387] [2022-07-22 20:52:11,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663817387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 20:52:11,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 20:52:11,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 20:52:11,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423150074] [2022-07-22 20:52:11,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 20:52:11,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 20:52:11,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 20:52:11,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 20:52:11,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 20:52:11,510 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-22 20:52:11,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 20:52:11,946 INFO L93 Difference]: Finished difference Result 5135 states and 5909 transitions. [2022-07-22 20:52:11,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 20:52:11,947 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-22 20:52:11,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 20:52:11,954 INFO L225 Difference]: With dead ends: 5135 [2022-07-22 20:52:11,954 INFO L226 Difference]: Without dead ends: 3747 [2022-07-22 20:52:11,956 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-22 20:52:11,957 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-22 20:52:11,957 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-22 20:52:11,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3747 states. [2022-07-22 20:52:12,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3747 to 3089. [2022-07-22 20:52:12,234 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-22 20:52:12,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 3491 transitions. [2022-07-22 20:52:12,238 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 3491 transitions. Word has length 207 [2022-07-22 20:52:12,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 20:52:12,238 INFO L495 AbstractCegarLoop]: Abstraction has 3089 states and 3491 transitions. [2022-07-22 20:52:12,239 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-22 20:52:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 3491 transitions. [2022-07-22 20:52:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-22 20:52:12,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 20:52:12,242 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-22 20:52:12,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-22 20:52:12,242 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 20:52:12,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 20:52:12,242 INFO L85 PathProgramCache]: Analyzing trace with hash -392769361, now seen corresponding path program 1 times [2022-07-22 20:52:12,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 20:52:12,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069312865] [2022-07-22 20:52:12,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 20:52:12,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 20:52:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 20:52:12,260 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 20:52:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 20:52:12,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 20:52:12,365 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 20:52:12,367 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-07-22 20:52:12,368 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-07-22 20:52:12,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-22 20:52:12,370 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-22 20:52:12,374 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 20:52:12,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 08:52:12 BoogieIcfgContainer [2022-07-22 20:52:12,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 20:52:12,519 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 20:52:12,519 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 20:52:12,519 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 20:52:12,520 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 08:51:05" (3/4) ... [2022-07-22 20:52:12,521 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-22 20:52:12,638 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 20:52:12,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 20:52:12,639 INFO L158 Benchmark]: Toolchain (without parser) took 68227.93ms. Allocated memory was 79.7MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 46.0MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 844.4MB. Max. memory is 16.1GB. [2022-07-22 20:52:12,642 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory was 59.0MB in the beginning and 59.0MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 20:52:12,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.90ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 45.8MB in the beginning and 66.7MB in the end (delta: -20.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 20:52:12,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.61ms. Allocated memory is still 96.5MB. Free memory was 66.7MB in the beginning and 63.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 20:52:12,643 INFO L158 Benchmark]: Boogie Preprocessor took 54.66ms. Allocated memory is still 96.5MB. Free memory was 63.8MB in the beginning and 61.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 20:52:12,643 INFO L158 Benchmark]: RCFGBuilder took 562.91ms. Allocated memory is still 96.5MB. Free memory was 61.3MB in the beginning and 69.7MB in the end (delta: -8.4MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2022-07-22 20:52:12,644 INFO L158 Benchmark]: TraceAbstraction took 67141.90ms. Allocated memory was 96.5MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 69.2MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 824.0MB. Max. memory is 16.1GB. [2022-07-22 20:52:12,644 INFO L158 Benchmark]: Witness Printer took 119.42ms. Allocated memory is still 8.1GB. Free memory was 7.2GB in the beginning and 7.2GB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-22 20:52:12,645 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.16ms. Allocated memory is still 79.7MB. Free memory was 59.0MB in the beginning and 59.0MB in the end (delta: 27.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.90ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 45.8MB in the beginning and 66.7MB in the end (delta: -20.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.61ms. Allocated memory is still 96.5MB. Free memory was 66.7MB in the beginning and 63.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.66ms. Allocated memory is still 96.5MB. Free memory was 63.8MB in the beginning and 61.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 562.91ms. Allocated memory is still 96.5MB. Free memory was 61.3MB in the beginning and 69.7MB in the end (delta: -8.4MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. * TraceAbstraction took 67141.90ms. Allocated memory was 96.5MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 69.2MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 824.0MB. Max. memory is 16.1GB. * Witness Printer took 119.42ms. Allocated memory is still 8.1GB. Free memory was 7.2GB in the beginning and 7.2GB in the end (delta: 28.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: 66.9s, OverallIterations: 38, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 34.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19746 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19363 mSDsluCounter, 33740 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20295 mSDsCounter, 4037 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15972 IncrementalHoareTripleChecker+Invalid, 20009 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4037 mSolverCounterUnsat, 13445 mSDtfsCounter, 15972 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.9s 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.6s 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-22 20:52:12,687 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