./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a561cc08-f094-49c2-b0da-a0d152b493dd/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_a561cc08-f094-49c2-b0da-a0d152b493dd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a561cc08-f094-49c2-b0da-a0d152b493dd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a561cc08-f094-49c2-b0da-a0d152b493dd/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a561cc08-f094-49c2-b0da-a0d152b493dd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a561cc08-f094-49c2-b0da-a0d152b493dd/bin/uautomizer --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 66ab76da4e49efdafe0b797e5286ec4c574180a4 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 18:15:39,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 18:15:39,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 18:15:39,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 18:15:39,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 18:15:39,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 18:15:39,575 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 18:15:39,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 18:15:39,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 18:15:39,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 18:15:39,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 18:15:39,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 18:15:39,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 18:15:39,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 18:15:39,589 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 18:15:39,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 18:15:39,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 18:15:39,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 18:15:39,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 18:15:39,606 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 18:15:39,608 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 18:15:39,610 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 18:15:39,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 18:15:39,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 18:15:39,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 18:15:39,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 18:15:39,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 18:15:39,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 18:15:39,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 18:15:39,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 18:15:39,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 18:15:39,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 18:15:39,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 18:15:39,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 18:15:39,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 18:15:39,628 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 18:15:39,629 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 18:15:39,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 18:15:39,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 18:15:39,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 18:15:39,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 18:15:39,635 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a561cc08-f094-49c2-b0da-a0d152b493dd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 18:15:39,661 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 18:15:39,661 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 18:15:39,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 18:15:39,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 18:15:39,663 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 18:15:39,663 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 18:15:39,663 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 18:15:39,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 18:15:39,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 18:15:39,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 18:15:39,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 18:15:39,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 18:15:39,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 18:15:39,665 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 18:15:39,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 18:15:39,666 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 18:15:39,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 18:15:39,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 18:15:39,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 18:15:39,667 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 18:15:39,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 18:15:39,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 18:15:39,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 18:15:39,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 18:15:39,668 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 18:15:39,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 18:15:39,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 18:15:39,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 18:15:39,669 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 18:15:39,669 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:/tmp/vcloud-vcloud-master/worker/run_dir_a561cc08-f094-49c2-b0da-a0d152b493dd/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_a561cc08-f094-49c2-b0da-a0d152b493dd/bin/uautomizer 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 -> 66ab76da4e49efdafe0b797e5286ec4c574180a4 [2020-11-29 18:15:39,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 18:15:39,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 18:15:39,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 18:15:39,989 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 18:15:39,990 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 18:15:39,991 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a561cc08-f094-49c2-b0da-a0d152b493dd/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2020-11-29 18:15:40,099 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a561cc08-f094-49c2-b0da-a0d152b493dd/bin/uautomizer/data/e7de22a57/b9c648f62e9644d6891dd83369e75b75/FLAG2ac9e7735 [2020-11-29 18:15:40,693 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 18:15:40,694 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a561cc08-f094-49c2-b0da-a0d152b493dd/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2020-11-29 18:15:40,709 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a561cc08-f094-49c2-b0da-a0d152b493dd/bin/uautomizer/data/e7de22a57/b9c648f62e9644d6891dd83369e75b75/FLAG2ac9e7735 [2020-11-29 18:15:40,939 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a561cc08-f094-49c2-b0da-a0d152b493dd/bin/uautomizer/data/e7de22a57/b9c648f62e9644d6891dd83369e75b75 [2020-11-29 18:15:40,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 18:15:40,942 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 18:15:40,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 18:15:40,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 18:15:40,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 18:15:40,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:15:40" (1/1) ... [2020-11-29 18:15:40,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3faec408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:40, skipping insertion in model container [2020-11-29 18:15:40,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:15:40" (1/1) ... [2020-11-29 18:15:40,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 18:15:41,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 18:15:41,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:15:41,466 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 18:15:41,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 18:15:41,640 INFO L208 MainTranslator]: Completed translation [2020-11-29 18:15:41,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:41 WrapperNode [2020-11-29 18:15:41,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 18:15:41,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 18:15:41,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 18:15:41,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 18:15:41,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:41" (1/1) ... [2020-11-29 18:15:41,677 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:41" (1/1) ... [2020-11-29 18:15:41,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 18:15:41,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 18:15:41,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 18:15:41,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 18:15:41,734 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:41" (1/1) ... [2020-11-29 18:15:41,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:41" (1/1) ... [2020-11-29 18:15:41,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:41" (1/1) ... [2020-11-29 18:15:41,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:41" (1/1) ... [2020-11-29 18:15:41,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:41" (1/1) ... [2020-11-29 18:15:41,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:41" (1/1) ... [2020-11-29 18:15:41,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:41" (1/1) ... [2020-11-29 18:15:41,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 18:15:41,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 18:15:41,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 18:15:41,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 18:15:41,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a561cc08-f094-49c2-b0da-a0d152b493dd/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 18:15:41,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 18:15:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-29 18:15:41,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 18:15:41,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 18:15:41,919 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-29 18:15:41,919 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-29 18:15:41,920 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-29 18:15:41,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-29 18:15:41,920 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-29 18:15:41,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-29 18:15:41,921 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-29 18:15:41,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-29 18:15:41,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 18:15:41,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-29 18:15:41,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 18:15:41,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 18:15:41,924 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-29 18:15:44,900 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 18:15:44,901 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-29 18:15:44,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:15:44 BoogieIcfgContainer [2020-11-29 18:15:44,903 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 18:15:44,904 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 18:15:44,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 18:15:44,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 18:15:44,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:15:40" (1/3) ... [2020-11-29 18:15:44,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176db83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:15:44, skipping insertion in model container [2020-11-29 18:15:44,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:15:41" (2/3) ... [2020-11-29 18:15:44,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176db83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:15:44, skipping insertion in model container [2020-11-29 18:15:44,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:15:44" (3/3) ... [2020-11-29 18:15:44,911 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2020-11-29 18:15:44,923 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-29 18:15:44,924 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 18:15:44,928 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 18:15:44,929 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-29 18:15:44,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,963 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,964 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,964 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,964 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,964 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,965 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,965 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,965 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,966 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,967 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,968 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,968 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,968 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,971 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,972 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,972 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,972 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,974 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,974 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,976 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,976 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,978 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,979 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,982 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,982 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,982 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,983 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,983 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,986 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,986 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,986 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,986 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,986 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,986 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,987 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,987 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,987 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,987 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 18:15:44,989 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-29 18:15:45,000 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-29 18:15:45,022 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 18:15:45,023 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 18:15:45,023 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 18:15:45,023 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 18:15:45,023 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 18:15:45,023 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 18:15:45,024 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 18:15:45,024 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 18:15:45,036 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-29 18:15:45,038 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 118 transitions, 256 flow [2020-11-29 18:15:45,041 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 118 transitions, 256 flow [2020-11-29 18:15:45,043 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 128 places, 118 transitions, 256 flow [2020-11-29 18:15:45,091 INFO L129 PetriNetUnfolder]: 3/114 cut-off events. [2020-11-29 18:15:45,092 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-29 18:15:45,096 INFO L80 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 114 events. 3/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2020-11-29 18:15:45,100 INFO L116 LiptonReduction]: Number of co-enabled transitions 2754 [2020-11-29 18:15:45,475 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-29 18:15:45,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-29 18:15:45,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:45,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-29 18:15:45,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:45,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-29 18:15:45,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:45,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-29 18:15:45,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:45,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-29 18:15:45,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:45,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-29 18:15:45,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:45,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-29 18:15:45,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 18:15:45,968 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-29 18:15:45,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 18:15:46,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:46,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:46,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:46,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:46,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:15:46,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:46,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:15:46,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:46,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:15:46,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-29 18:15:46,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-29 18:15:46,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-29 18:15:46,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-29 18:15:46,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-29 18:15:46,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-29 18:15:46,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-29 18:15:46,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 18:15:46,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:46,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:46,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:46,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:46,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:15:46,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:46,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:15:46,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:46,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:15:46,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-29 18:15:46,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-29 18:15:46,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-29 18:15:46,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-29 18:15:46,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-29 18:15:46,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-29 18:15:46,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 18:15:46,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-29 18:15:46,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-29 18:15:46,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-29 18:15:46,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-29 18:15:46,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-29 18:15:46,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 18:15:46,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:46,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:46,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:46,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:46,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:15:46,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:46,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:15:46,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:46,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:15:46,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-29 18:15:46,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-29 18:15:46,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-29 18:15:46,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-29 18:15:46,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-29 18:15:46,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-29 18:15:46,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 18:15:46,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-29 18:15:46,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-29 18:15:46,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-29 18:15:46,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:46,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-11-29 18:15:46,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:46,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-11-29 18:15:46,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:47,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 18:15:47,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:47,068 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:47,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:47,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:47,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:47,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:47,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:15:47,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:47,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:15:47,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:47,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:15:47,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-29 18:15:47,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:47,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-29 18:15:47,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:47,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-29 18:15:47,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:47,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-29 18:15:47,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:47,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-29 18:15:47,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:47,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-29 18:15:47,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 18:15:47,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-29 18:15:47,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:47,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-29 18:15:47,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:47,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-29 18:15:47,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:47,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-29 18:15:47,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:47,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-29 18:15:47,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:48,610 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-11-29 18:15:48,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-29 18:15:48,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:48,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-29 18:15:48,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:49,451 WARN L193 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-11-29 18:15:49,702 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-29 18:15:49,868 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-29 18:15:49,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-29 18:15:49,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:49,914 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-29 18:15:49,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:49,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-29 18:15:49,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 18:15:49,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-29 18:15:49,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:49,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 18:15:49,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:49,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:49,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:49,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:49,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:50,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:15:50,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:50,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:15:50,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:50,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:15:50,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-11-29 18:15:50,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-29 18:15:50,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-11-29 18:15:50,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-29 18:15:50,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-29 18:15:50,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-29 18:15:50,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-29 18:15:50,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-29 18:15:50,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:50,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-11-29 18:15:50,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:50,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 18:15:50,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:50,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 18:15:50,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:50,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:50,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:50,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-29 18:15:50,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:50,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,275 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:50,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-29 18:15:50,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:15:50,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-29 18:15:50,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 18:15:50,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:50,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-29 18:15:50,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 18:15:50,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-29 18:15:50,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-29 18:15:50,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:50,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-11-29 18:15:50,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:50,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 18:15:50,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:50,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 18:15:50,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:50,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:50,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:50,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-11-29 18:15:50,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:50,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-11-29 18:15:50,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 18:15:50,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 18:15:50,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:51,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 18:15:51,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:51,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 18:15:51,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 18:15:51,377 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-29 18:15:51,510 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-29 18:15:52,401 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-11-29 18:15:52,627 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-29 18:15:52,744 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-11-29 18:15:53,170 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-11-29 18:15:53,382 WARN L193 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-29 18:15:53,421 INFO L131 LiptonReduction]: Checked pairs total: 7788 [2020-11-29 18:15:53,421 INFO L133 LiptonReduction]: Total number of compositions: 104 [2020-11-29 18:15:53,428 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-11-29 18:15:53,695 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-11-29 18:15:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-11-29 18:15:53,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-29 18:15:53,702 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:15:53,702 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:15:53,703 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:15:53,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:15:53,708 INFO L82 PathProgramCache]: Analyzing trace with hash 488261609, now seen corresponding path program 1 times [2020-11-29 18:15:53,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:15:53,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221249425] [2020-11-29 18:15:53,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:15:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:15:53,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:15:53,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221249425] [2020-11-29 18:15:53,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:15:53,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 18:15:53,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851097237] [2020-11-29 18:15:53,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 18:15:53,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:15:53,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 18:15:53,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:15:53,944 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-11-29 18:15:54,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:15:54,072 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-11-29 18:15:54,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 18:15:54,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-29 18:15:54,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:15:54,119 INFO L225 Difference]: With dead ends: 3250 [2020-11-29 18:15:54,120 INFO L226 Difference]: Without dead ends: 2750 [2020-11-29 18:15:54,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 18:15:54,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2020-11-29 18:15:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2750. [2020-11-29 18:15:54,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2750 states. [2020-11-29 18:15:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 10663 transitions. [2020-11-29 18:15:54,358 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 10663 transitions. Word has length 7 [2020-11-29 18:15:54,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:15:54,359 INFO L481 AbstractCegarLoop]: Abstraction has 2750 states and 10663 transitions. [2020-11-29 18:15:54,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 18:15:54,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 10663 transitions. [2020-11-29 18:15:54,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 18:15:54,364 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:15:54,364 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:15:54,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 18:15:54,364 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:15:54,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:15:54,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1532014145, now seen corresponding path program 1 times [2020-11-29 18:15:54,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:15:54,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410588424] [2020-11-29 18:15:54,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:15:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:15:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:15:54,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410588424] [2020-11-29 18:15:54,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:15:54,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:15:54,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226096784] [2020-11-29 18:15:54,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 18:15:54,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:15:54,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 18:15:54,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:15:54,662 INFO L87 Difference]: Start difference. First operand 2750 states and 10663 transitions. Second operand 5 states. [2020-11-29 18:15:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:15:54,867 INFO L93 Difference]: Finished difference Result 3230 states and 12152 transitions. [2020-11-29 18:15:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 18:15:54,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-11-29 18:15:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:15:54,900 INFO L225 Difference]: With dead ends: 3230 [2020-11-29 18:15:54,900 INFO L226 Difference]: Without dead ends: 2730 [2020-11-29 18:15:54,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:15:54,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2730 states. [2020-11-29 18:15:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2730 to 2730. [2020-11-29 18:15:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2730 states. [2020-11-29 18:15:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 10567 transitions. [2020-11-29 18:15:55,029 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 10567 transitions. Word has length 12 [2020-11-29 18:15:55,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:15:55,029 INFO L481 AbstractCegarLoop]: Abstraction has 2730 states and 10567 transitions. [2020-11-29 18:15:55,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 18:15:55,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 10567 transitions. [2020-11-29 18:15:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 18:15:55,035 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:15:55,036 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:15:55,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 18:15:55,036 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:15:55,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:15:55,037 INFO L82 PathProgramCache]: Analyzing trace with hash 870868969, now seen corresponding path program 1 times [2020-11-29 18:15:55,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:15:55,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199191042] [2020-11-29 18:15:55,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:15:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:15:55,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:15:55,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199191042] [2020-11-29 18:15:55,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:15:55,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:15:55,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503150641] [2020-11-29 18:15:55,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 18:15:55,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:15:55,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 18:15:55,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:15:55,317 INFO L87 Difference]: Start difference. First operand 2730 states and 10567 transitions. Second operand 5 states. [2020-11-29 18:15:55,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:15:55,534 INFO L93 Difference]: Finished difference Result 3120 states and 11724 transitions. [2020-11-29 18:15:55,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 18:15:55,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-29 18:15:55,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:15:55,563 INFO L225 Difference]: With dead ends: 3120 [2020-11-29 18:15:55,563 INFO L226 Difference]: Without dead ends: 2670 [2020-11-29 18:15:55,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:15:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2020-11-29 18:15:55,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2670. [2020-11-29 18:15:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2670 states. [2020-11-29 18:15:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 10299 transitions. [2020-11-29 18:15:55,751 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 10299 transitions. Word has length 13 [2020-11-29 18:15:55,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:15:55,751 INFO L481 AbstractCegarLoop]: Abstraction has 2670 states and 10299 transitions. [2020-11-29 18:15:55,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 18:15:55,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 10299 transitions. [2020-11-29 18:15:55,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 18:15:55,754 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:15:55,754 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:15:55,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 18:15:55,754 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:15:55,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:15:55,755 INFO L82 PathProgramCache]: Analyzing trace with hash 245919980, now seen corresponding path program 1 times [2020-11-29 18:15:55,755 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:15:55,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851281615] [2020-11-29 18:15:55,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:15:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:15:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:15:55,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851281615] [2020-11-29 18:15:55,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:15:55,945 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:15:55,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911589566] [2020-11-29 18:15:55,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 18:15:55,946 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:15:55,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:15:55,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:15:55,946 INFO L87 Difference]: Start difference. First operand 2670 states and 10299 transitions. Second operand 6 states. [2020-11-29 18:15:56,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:15:56,278 INFO L93 Difference]: Finished difference Result 3138 states and 11831 transitions. [2020-11-29 18:15:56,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 18:15:56,279 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-11-29 18:15:56,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:15:56,307 INFO L225 Difference]: With dead ends: 3138 [2020-11-29 18:15:56,307 INFO L226 Difference]: Without dead ends: 2726 [2020-11-29 18:15:56,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-29 18:15:56,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2726 states. [2020-11-29 18:15:56,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2726 to 2694. [2020-11-29 18:15:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2694 states. [2020-11-29 18:15:56,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 10389 transitions. [2020-11-29 18:15:56,419 INFO L78 Accepts]: Start accepts. Automaton has 2694 states and 10389 transitions. Word has length 13 [2020-11-29 18:15:56,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:15:56,419 INFO L481 AbstractCegarLoop]: Abstraction has 2694 states and 10389 transitions. [2020-11-29 18:15:56,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 18:15:56,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 10389 transitions. [2020-11-29 18:15:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 18:15:56,421 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:15:56,421 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:15:56,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 18:15:56,422 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:15:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:15:56,422 INFO L82 PathProgramCache]: Analyzing trace with hash 247765100, now seen corresponding path program 2 times [2020-11-29 18:15:56,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:15:56,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102413544] [2020-11-29 18:15:56,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:15:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:15:56,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:15:56,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102413544] [2020-11-29 18:15:56,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:15:56,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:15:56,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563800065] [2020-11-29 18:15:56,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 18:15:56,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:15:56,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 18:15:56,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:15:56,559 INFO L87 Difference]: Start difference. First operand 2694 states and 10389 transitions. Second operand 5 states. [2020-11-29 18:15:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:15:56,743 INFO L93 Difference]: Finished difference Result 3014 states and 11305 transitions. [2020-11-29 18:15:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 18:15:56,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-29 18:15:56,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:15:56,769 INFO L225 Difference]: With dead ends: 3014 [2020-11-29 18:15:56,770 INFO L226 Difference]: Without dead ends: 2614 [2020-11-29 18:15:56,770 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:15:56,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2614 states. [2020-11-29 18:15:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2614 to 2614. [2020-11-29 18:15:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2614 states. [2020-11-29 18:15:56,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 10025 transitions. [2020-11-29 18:15:56,867 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 10025 transitions. Word has length 13 [2020-11-29 18:15:56,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:15:56,867 INFO L481 AbstractCegarLoop]: Abstraction has 2614 states and 10025 transitions. [2020-11-29 18:15:56,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 18:15:56,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 10025 transitions. [2020-11-29 18:15:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 18:15:56,870 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:15:56,870 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:15:56,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 18:15:56,871 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:15:56,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:15:56,871 INFO L82 PathProgramCache]: Analyzing trace with hash -2067239881, now seen corresponding path program 1 times [2020-11-29 18:15:56,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:15:56,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234987631] [2020-11-29 18:15:56,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:15:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:15:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:15:56,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234987631] [2020-11-29 18:15:56,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:15:56,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:15:56,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265633341] [2020-11-29 18:15:56,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 18:15:56,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:15:56,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:15:56,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:15:56,985 INFO L87 Difference]: Start difference. First operand 2614 states and 10025 transitions. Second operand 6 states. [2020-11-29 18:15:57,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:15:57,225 INFO L93 Difference]: Finished difference Result 2922 states and 10956 transitions. [2020-11-29 18:15:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 18:15:57,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-11-29 18:15:57,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:15:57,239 INFO L225 Difference]: With dead ends: 2922 [2020-11-29 18:15:57,240 INFO L226 Difference]: Without dead ends: 2614 [2020-11-29 18:15:57,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:15:57,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2614 states. [2020-11-29 18:15:57,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2614 to 2614. [2020-11-29 18:15:57,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2614 states. [2020-11-29 18:15:57,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 10005 transitions. [2020-11-29 18:15:57,379 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 10005 transitions. Word has length 14 [2020-11-29 18:15:57,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:15:57,379 INFO L481 AbstractCegarLoop]: Abstraction has 2614 states and 10005 transitions. [2020-11-29 18:15:57,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 18:15:57,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 10005 transitions. [2020-11-29 18:15:57,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 18:15:57,383 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:15:57,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:15:57,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 18:15:57,383 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:15:57,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:15:57,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1225256004, now seen corresponding path program 1 times [2020-11-29 18:15:57,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:15:57,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997445679] [2020-11-29 18:15:57,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:15:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:15:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:15:57,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997445679] [2020-11-29 18:15:57,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:15:57,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:15:57,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539446872] [2020-11-29 18:15:57,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 18:15:57,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:15:57,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 18:15:57,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:15:57,567 INFO L87 Difference]: Start difference. First operand 2614 states and 10005 transitions. Second operand 5 states. [2020-11-29 18:15:57,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:15:57,724 INFO L93 Difference]: Finished difference Result 3098 states and 11673 transitions. [2020-11-29 18:15:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:15:57,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-29 18:15:57,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:15:57,738 INFO L225 Difference]: With dead ends: 3098 [2020-11-29 18:15:57,738 INFO L226 Difference]: Without dead ends: 2738 [2020-11-29 18:15:57,739 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:15:57,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2020-11-29 18:15:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 2726. [2020-11-29 18:15:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2020-11-29 18:15:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 10473 transitions. [2020-11-29 18:15:57,855 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 10473 transitions. Word has length 14 [2020-11-29 18:15:57,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:15:57,855 INFO L481 AbstractCegarLoop]: Abstraction has 2726 states and 10473 transitions. [2020-11-29 18:15:57,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 18:15:57,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 10473 transitions. [2020-11-29 18:15:57,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 18:15:57,859 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:15:57,859 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:15:57,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 18:15:57,859 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:15:57,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:15:57,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1227101124, now seen corresponding path program 2 times [2020-11-29 18:15:57,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:15:57,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650056109] [2020-11-29 18:15:57,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:15:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:15:58,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:15:58,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650056109] [2020-11-29 18:15:58,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:15:58,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:15:58,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797425798] [2020-11-29 18:15:58,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 18:15:58,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:15:58,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:15:58,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:15:58,021 INFO L87 Difference]: Start difference. First operand 2726 states and 10473 transitions. Second operand 6 states. [2020-11-29 18:15:58,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:15:58,307 INFO L93 Difference]: Finished difference Result 3222 states and 12117 transitions. [2020-11-29 18:15:58,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 18:15:58,308 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-11-29 18:15:58,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:15:58,321 INFO L225 Difference]: With dead ends: 3222 [2020-11-29 18:15:58,322 INFO L226 Difference]: Without dead ends: 2822 [2020-11-29 18:15:58,322 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-11-29 18:15:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2020-11-29 18:15:58,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2750. [2020-11-29 18:15:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2750 states. [2020-11-29 18:15:58,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 10521 transitions. [2020-11-29 18:15:58,473 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 10521 transitions. Word has length 14 [2020-11-29 18:15:58,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:15:58,474 INFO L481 AbstractCegarLoop]: Abstraction has 2750 states and 10521 transitions. [2020-11-29 18:15:58,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 18:15:58,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 10521 transitions. [2020-11-29 18:15:58,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 18:15:58,477 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:15:58,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:15:58,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 18:15:58,478 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:15:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:15:58,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1211490680, now seen corresponding path program 1 times [2020-11-29 18:15:58,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:15:58,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546075669] [2020-11-29 18:15:58,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:15:58,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:15:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:15:58,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546075669] [2020-11-29 18:15:58,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:15:58,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 18:15:58,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642095423] [2020-11-29 18:15:58,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 18:15:58,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:15:58,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 18:15:58,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-29 18:15:58,774 INFO L87 Difference]: Start difference. First operand 2750 states and 10521 transitions. Second operand 7 states. [2020-11-29 18:15:59,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:15:59,007 INFO L93 Difference]: Finished difference Result 2894 states and 10869 transitions. [2020-11-29 18:15:59,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:15:59,008 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-11-29 18:15:59,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:15:59,020 INFO L225 Difference]: With dead ends: 2894 [2020-11-29 18:15:59,021 INFO L226 Difference]: Without dead ends: 2654 [2020-11-29 18:15:59,021 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:15:59,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2020-11-29 18:15:59,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2630. [2020-11-29 18:15:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2020-11-29 18:15:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 10035 transitions. [2020-11-29 18:15:59,112 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 10035 transitions. Word has length 15 [2020-11-29 18:15:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:15:59,112 INFO L481 AbstractCegarLoop]: Abstraction has 2630 states and 10035 transitions. [2020-11-29 18:15:59,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 18:15:59,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 10035 transitions. [2020-11-29 18:15:59,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 18:15:59,116 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:15:59,116 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:15:59,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 18:15:59,116 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:15:59,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:15:59,117 INFO L82 PathProgramCache]: Analyzing trace with hash 338194870, now seen corresponding path program 1 times [2020-11-29 18:15:59,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:15:59,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039342554] [2020-11-29 18:15:59,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:15:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:15:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:15:59,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039342554] [2020-11-29 18:15:59,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:15:59,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 18:15:59,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191333567] [2020-11-29 18:15:59,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 18:15:59,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:15:59,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 18:15:59,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-29 18:15:59,240 INFO L87 Difference]: Start difference. First operand 2630 states and 10035 transitions. Second operand 7 states. [2020-11-29 18:15:59,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:15:59,456 INFO L93 Difference]: Finished difference Result 2994 states and 11256 transitions. [2020-11-29 18:15:59,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 18:15:59,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-11-29 18:15:59,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:15:59,469 INFO L225 Difference]: With dead ends: 2994 [2020-11-29 18:15:59,469 INFO L226 Difference]: Without dead ends: 2738 [2020-11-29 18:15:59,470 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:15:59,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2020-11-29 18:15:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 2602. [2020-11-29 18:15:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2602 states. [2020-11-29 18:15:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 9886 transitions. [2020-11-29 18:15:59,618 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 9886 transitions. Word has length 15 [2020-11-29 18:15:59,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:15:59,618 INFO L481 AbstractCegarLoop]: Abstraction has 2602 states and 9886 transitions. [2020-11-29 18:15:59,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 18:15:59,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 9886 transitions. [2020-11-29 18:15:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 18:15:59,621 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:15:59,621 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:15:59,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 18:15:59,621 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:15:59,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:15:59,624 INFO L82 PathProgramCache]: Analyzing trace with hash 340039990, now seen corresponding path program 2 times [2020-11-29 18:15:59,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:15:59,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264469431] [2020-11-29 18:15:59,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:15:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:15:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:15:59,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264469431] [2020-11-29 18:15:59,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:15:59,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 18:15:59,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926078618] [2020-11-29 18:15:59,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 18:15:59,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:15:59,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 18:15:59,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-29 18:15:59,735 INFO L87 Difference]: Start difference. First operand 2602 states and 9886 transitions. Second operand 7 states. [2020-11-29 18:15:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:15:59,993 INFO L93 Difference]: Finished difference Result 3322 states and 12426 transitions. [2020-11-29 18:15:59,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 18:15:59,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-11-29 18:15:59,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:16:00,005 INFO L225 Difference]: With dead ends: 3322 [2020-11-29 18:16:00,006 INFO L226 Difference]: Without dead ends: 3010 [2020-11-29 18:16:00,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2020-11-29 18:16:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3010 states. [2020-11-29 18:16:00,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3010 to 2654. [2020-11-29 18:16:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2654 states. [2020-11-29 18:16:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 10021 transitions. [2020-11-29 18:16:00,099 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 10021 transitions. Word has length 15 [2020-11-29 18:16:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:16:00,100 INFO L481 AbstractCegarLoop]: Abstraction has 2654 states and 10021 transitions. [2020-11-29 18:16:00,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 18:16:00,100 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 10021 transitions. [2020-11-29 18:16:00,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-29 18:16:00,104 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:16:00,104 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:16:00,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 18:16:00,105 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:16:00,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:16:00,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1096616325, now seen corresponding path program 1 times [2020-11-29 18:16:00,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:16:00,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099445540] [2020-11-29 18:16:00,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:16:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:16:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:16:00,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099445540] [2020-11-29 18:16:00,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:16:00,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 18:16:00,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192445482] [2020-11-29 18:16:00,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 18:16:00,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:16:00,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 18:16:00,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:16:00,268 INFO L87 Difference]: Start difference. First operand 2654 states and 10021 transitions. Second operand 8 states. [2020-11-29 18:16:00,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:16:00,466 INFO L93 Difference]: Finished difference Result 3346 states and 12512 transitions. [2020-11-29 18:16:00,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 18:16:00,467 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-11-29 18:16:00,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:16:00,479 INFO L225 Difference]: With dead ends: 3346 [2020-11-29 18:16:00,479 INFO L226 Difference]: Without dead ends: 3154 [2020-11-29 18:16:00,480 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-29 18:16:00,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2020-11-29 18:16:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 3018. [2020-11-29 18:16:00,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2020-11-29 18:16:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 11330 transitions. [2020-11-29 18:16:00,574 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 11330 transitions. Word has length 16 [2020-11-29 18:16:00,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:16:00,575 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 11330 transitions. [2020-11-29 18:16:00,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 18:16:00,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 11330 transitions. [2020-11-29 18:16:00,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-29 18:16:00,580 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:16:00,580 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:16:00,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 18:16:00,581 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:16:00,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:16:00,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1098461445, now seen corresponding path program 2 times [2020-11-29 18:16:00,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:16:00,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646263491] [2020-11-29 18:16:00,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:16:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:16:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:16:00,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646263491] [2020-11-29 18:16:00,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:16:00,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 18:16:00,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717743105] [2020-11-29 18:16:00,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 18:16:00,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:16:00,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 18:16:00,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:16:00,802 INFO L87 Difference]: Start difference. First operand 3018 states and 11330 transitions. Second operand 8 states. [2020-11-29 18:16:01,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:16:01,038 INFO L93 Difference]: Finished difference Result 3442 states and 12800 transitions. [2020-11-29 18:16:01,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 18:16:01,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-11-29 18:16:01,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:16:01,051 INFO L225 Difference]: With dead ends: 3442 [2020-11-29 18:16:01,051 INFO L226 Difference]: Without dead ends: 3250 [2020-11-29 18:16:01,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-29 18:16:01,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2020-11-29 18:16:01,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 2974. [2020-11-29 18:16:01,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2974 states. [2020-11-29 18:16:01,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 11181 transitions. [2020-11-29 18:16:01,142 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 11181 transitions. Word has length 16 [2020-11-29 18:16:01,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:16:01,142 INFO L481 AbstractCegarLoop]: Abstraction has 2974 states and 11181 transitions. [2020-11-29 18:16:01,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 18:16:01,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 11181 transitions. [2020-11-29 18:16:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-29 18:16:01,148 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:16:01,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:16:01,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 18:16:01,148 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:16:01,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:16:01,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1891274807, now seen corresponding path program 3 times [2020-11-29 18:16:01,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:16:01,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58207484] [2020-11-29 18:16:01,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:16:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:16:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:16:01,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58207484] [2020-11-29 18:16:01,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:16:01,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 18:16:01,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99092379] [2020-11-29 18:16:01,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 18:16:01,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:16:01,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 18:16:01,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:16:01,455 INFO L87 Difference]: Start difference. First operand 2974 states and 11181 transitions. Second operand 8 states. [2020-11-29 18:16:01,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:16:01,735 INFO L93 Difference]: Finished difference Result 3402 states and 12630 transitions. [2020-11-29 18:16:01,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 18:16:01,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-11-29 18:16:01,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:16:01,742 INFO L225 Difference]: With dead ends: 3402 [2020-11-29 18:16:01,742 INFO L226 Difference]: Without dead ends: 3210 [2020-11-29 18:16:01,742 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-11-29 18:16:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3210 states. [2020-11-29 18:16:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3210 to 2938. [2020-11-29 18:16:01,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2938 states. [2020-11-29 18:16:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2938 states to 2938 states and 11018 transitions. [2020-11-29 18:16:01,865 INFO L78 Accepts]: Start accepts. Automaton has 2938 states and 11018 transitions. Word has length 16 [2020-11-29 18:16:01,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:16:01,866 INFO L481 AbstractCegarLoop]: Abstraction has 2938 states and 11018 transitions. [2020-11-29 18:16:01,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 18:16:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2938 states and 11018 transitions. [2020-11-29 18:16:01,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-29 18:16:01,872 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:16:01,872 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:16:01,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 18:16:01,872 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:16:01,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:16:01,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1951241207, now seen corresponding path program 4 times [2020-11-29 18:16:01,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:16:01,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862042948] [2020-11-29 18:16:01,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:16:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:16:02,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:16:02,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862042948] [2020-11-29 18:16:02,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:16:02,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 18:16:02,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390650132] [2020-11-29 18:16:02,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 18:16:02,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:16:02,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 18:16:02,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:16:02,175 INFO L87 Difference]: Start difference. First operand 2938 states and 11018 transitions. Second operand 8 states. [2020-11-29 18:16:02,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:16:02,586 INFO L93 Difference]: Finished difference Result 3634 states and 13468 transitions. [2020-11-29 18:16:02,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 18:16:02,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-11-29 18:16:02,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:16:02,600 INFO L225 Difference]: With dead ends: 3634 [2020-11-29 18:16:02,600 INFO L226 Difference]: Without dead ends: 3410 [2020-11-29 18:16:02,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-29 18:16:02,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3410 states. [2020-11-29 18:16:02,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3410 to 2678. [2020-11-29 18:16:02,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2678 states. [2020-11-29 18:16:02,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2678 states and 10035 transitions. [2020-11-29 18:16:02,704 INFO L78 Accepts]: Start accepts. Automaton has 2678 states and 10035 transitions. Word has length 16 [2020-11-29 18:16:02,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:16:02,704 INFO L481 AbstractCegarLoop]: Abstraction has 2678 states and 10035 transitions. [2020-11-29 18:16:02,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 18:16:02,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 10035 transitions. [2020-11-29 18:16:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-29 18:16:02,710 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:16:02,710 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:16:02,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 18:16:02,710 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:16:02,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:16:02,711 INFO L82 PathProgramCache]: Analyzing trace with hash 648152453, now seen corresponding path program 1 times [2020-11-29 18:16:02,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:16:02,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555258035] [2020-11-29 18:16:02,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:16:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:16:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:16:02,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555258035] [2020-11-29 18:16:02,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:16:02,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 18:16:02,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531626703] [2020-11-29 18:16:02,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 18:16:02,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:16:02,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 18:16:02,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 18:16:02,804 INFO L87 Difference]: Start difference. First operand 2678 states and 10035 transitions. Second operand 4 states. [2020-11-29 18:16:02,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:16:02,860 INFO L93 Difference]: Finished difference Result 2726 states and 9322 transitions. [2020-11-29 18:16:02,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 18:16:02,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-11-29 18:16:02,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:16:02,867 INFO L225 Difference]: With dead ends: 2726 [2020-11-29 18:16:02,867 INFO L226 Difference]: Without dead ends: 2090 [2020-11-29 18:16:02,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:16:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2020-11-29 18:16:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090. [2020-11-29 18:16:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2020-11-29 18:16:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7095 transitions. [2020-11-29 18:16:02,935 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7095 transitions. Word has length 16 [2020-11-29 18:16:02,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:16:02,935 INFO L481 AbstractCegarLoop]: Abstraction has 2090 states and 7095 transitions. [2020-11-29 18:16:02,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 18:16:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7095 transitions. [2020-11-29 18:16:02,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-29 18:16:02,940 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:16:02,940 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:16:02,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-29 18:16:02,940 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:16:02,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:16:02,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1352963929, now seen corresponding path program 1 times [2020-11-29 18:16:02,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:16:02,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271354435] [2020-11-29 18:16:02,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:16:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:16:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:16:03,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271354435] [2020-11-29 18:16:03,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:16:03,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:16:03,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230219880] [2020-11-29 18:16:03,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 18:16:03,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:16:03,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 18:16:03,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 18:16:03,036 INFO L87 Difference]: Start difference. First operand 2090 states and 7095 transitions. Second operand 5 states. [2020-11-29 18:16:03,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:16:03,107 INFO L93 Difference]: Finished difference Result 1722 states and 5345 transitions. [2020-11-29 18:16:03,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:16:03,108 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-11-29 18:16:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:16:03,111 INFO L225 Difference]: With dead ends: 1722 [2020-11-29 18:16:03,111 INFO L226 Difference]: Without dead ends: 1320 [2020-11-29 18:16:03,112 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:16:03,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2020-11-29 18:16:03,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2020-11-29 18:16:03,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2020-11-29 18:16:03,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 4015 transitions. [2020-11-29 18:16:03,143 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 4015 transitions. Word has length 17 [2020-11-29 18:16:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:16:03,143 INFO L481 AbstractCegarLoop]: Abstraction has 1320 states and 4015 transitions. [2020-11-29 18:16:03,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 18:16:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 4015 transitions. [2020-11-29 18:16:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-29 18:16:03,146 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:16:03,146 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:16:03,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-29 18:16:03,147 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:16:03,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:16:03,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1235949778, now seen corresponding path program 1 times [2020-11-29 18:16:03,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:16:03,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520410239] [2020-11-29 18:16:03,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:16:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:16:03,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:16:03,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520410239] [2020-11-29 18:16:03,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:16:03,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 18:16:03,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112008518] [2020-11-29 18:16:03,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 18:16:03,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:16:03,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:16:03,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:16:03,233 INFO L87 Difference]: Start difference. First operand 1320 states and 4015 transitions. Second operand 6 states. [2020-11-29 18:16:03,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:16:03,346 INFO L93 Difference]: Finished difference Result 2562 states and 7462 transitions. [2020-11-29 18:16:03,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 18:16:03,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-11-29 18:16:03,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:16:03,349 INFO L225 Difference]: With dead ends: 2562 [2020-11-29 18:16:03,349 INFO L226 Difference]: Without dead ends: 1432 [2020-11-29 18:16:03,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-29 18:16:03,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-11-29 18:16:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1274. [2020-11-29 18:16:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2020-11-29 18:16:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 3667 transitions. [2020-11-29 18:16:03,378 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 3667 transitions. Word has length 19 [2020-11-29 18:16:03,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:16:03,379 INFO L481 AbstractCegarLoop]: Abstraction has 1274 states and 3667 transitions. [2020-11-29 18:16:03,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 18:16:03,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 3667 transitions. [2020-11-29 18:16:03,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 18:16:03,382 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:16:03,382 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:16:03,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-29 18:16:03,382 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:16:03,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:16:03,383 INFO L82 PathProgramCache]: Analyzing trace with hash 470011188, now seen corresponding path program 1 times [2020-11-29 18:16:03,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:16:03,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786411977] [2020-11-29 18:16:03,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:16:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:16:03,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:16:03,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786411977] [2020-11-29 18:16:03,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:16:03,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 18:16:03,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685681410] [2020-11-29 18:16:03,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 18:16:03,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:16:03,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 18:16:03,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 18:16:03,479 INFO L87 Difference]: Start difference. First operand 1274 states and 3667 transitions. Second operand 6 states. [2020-11-29 18:16:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:16:03,555 INFO L93 Difference]: Finished difference Result 1069 states and 3026 transitions. [2020-11-29 18:16:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 18:16:03,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-11-29 18:16:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:16:03,557 INFO L225 Difference]: With dead ends: 1069 [2020-11-29 18:16:03,557 INFO L226 Difference]: Without dead ends: 940 [2020-11-29 18:16:03,557 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-29 18:16:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2020-11-29 18:16:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 872. [2020-11-29 18:16:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2020-11-29 18:16:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 2501 transitions. [2020-11-29 18:16:03,576 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 2501 transitions. Word has length 20 [2020-11-29 18:16:03,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:16:03,577 INFO L481 AbstractCegarLoop]: Abstraction has 872 states and 2501 transitions. [2020-11-29 18:16:03,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 18:16:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 2501 transitions. [2020-11-29 18:16:03,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 18:16:03,579 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:16:03,580 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:16:03,580 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-29 18:16:03,580 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:16:03,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:16:03,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1831088851, now seen corresponding path program 1 times [2020-11-29 18:16:03,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:16:03,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838502591] [2020-11-29 18:16:03,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:16:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:16:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:16:03,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838502591] [2020-11-29 18:16:03,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:16:03,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 18:16:03,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329613904] [2020-11-29 18:16:03,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 18:16:03,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:16:03,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 18:16:03,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-29 18:16:03,695 INFO L87 Difference]: Start difference. First operand 872 states and 2501 transitions. Second operand 7 states. [2020-11-29 18:16:03,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:16:03,785 INFO L93 Difference]: Finished difference Result 829 states and 2414 transitions. [2020-11-29 18:16:03,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 18:16:03,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-11-29 18:16:03,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:16:03,786 INFO L225 Difference]: With dead ends: 829 [2020-11-29 18:16:03,786 INFO L226 Difference]: Without dead ends: 514 [2020-11-29 18:16:03,786 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:16:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-11-29 18:16:03,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 458. [2020-11-29 18:16:03,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-11-29 18:16:03,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1295 transitions. [2020-11-29 18:16:03,794 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1295 transitions. Word has length 23 [2020-11-29 18:16:03,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:16:03,794 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1295 transitions. [2020-11-29 18:16:03,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 18:16:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1295 transitions. [2020-11-29 18:16:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-29 18:16:03,796 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:16:03,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:16:03,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-29 18:16:03,796 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:16:03,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:16:03,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1944802539, now seen corresponding path program 1 times [2020-11-29 18:16:03,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:16:03,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468420780] [2020-11-29 18:16:03,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:16:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:16:04,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:16:04,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468420780] [2020-11-29 18:16:04,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:16:04,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 18:16:04,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865548333] [2020-11-29 18:16:04,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 18:16:04,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:16:04,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 18:16:04,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-29 18:16:04,073 INFO L87 Difference]: Start difference. First operand 458 states and 1295 transitions. Second operand 9 states. [2020-11-29 18:16:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:16:04,275 INFO L93 Difference]: Finished difference Result 917 states and 2576 transitions. [2020-11-29 18:16:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 18:16:04,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-11-29 18:16:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:16:04,276 INFO L225 Difference]: With dead ends: 917 [2020-11-29 18:16:04,276 INFO L226 Difference]: Without dead ends: 606 [2020-11-29 18:16:04,277 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2020-11-29 18:16:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2020-11-29 18:16:04,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 458. [2020-11-29 18:16:04,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-11-29 18:16:04,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1251 transitions. [2020-11-29 18:16:04,286 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1251 transitions. Word has length 27 [2020-11-29 18:16:04,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:16:04,286 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1251 transitions. [2020-11-29 18:16:04,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 18:16:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1251 transitions. [2020-11-29 18:16:04,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-29 18:16:04,288 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:16:04,288 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:16:04,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-29 18:16:04,288 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:16:04,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:16:04,289 INFO L82 PathProgramCache]: Analyzing trace with hash 947781317, now seen corresponding path program 2 times [2020-11-29 18:16:04,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:16:04,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324441804] [2020-11-29 18:16:04,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:16:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:16:04,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:16:04,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324441804] [2020-11-29 18:16:04,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:16:04,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 18:16:04,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698853895] [2020-11-29 18:16:04,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 18:16:04,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:16:04,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 18:16:04,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-29 18:16:04,555 INFO L87 Difference]: Start difference. First operand 458 states and 1251 transitions. Second operand 8 states. [2020-11-29 18:16:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:16:04,815 INFO L93 Difference]: Finished difference Result 786 states and 2129 transitions. [2020-11-29 18:16:04,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-29 18:16:04,816 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-11-29 18:16:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:16:04,817 INFO L225 Difference]: With dead ends: 786 [2020-11-29 18:16:04,817 INFO L226 Difference]: Without dead ends: 534 [2020-11-29 18:16:04,817 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-11-29 18:16:04,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2020-11-29 18:16:04,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 386. [2020-11-29 18:16:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2020-11-29 18:16:04,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1083 transitions. [2020-11-29 18:16:04,826 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 1083 transitions. Word has length 27 [2020-11-29 18:16:04,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:16:04,827 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 1083 transitions. [2020-11-29 18:16:04,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 18:16:04,827 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 1083 transitions. [2020-11-29 18:16:04,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-29 18:16:04,828 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:16:04,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:16:04,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-29 18:16:04,828 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:16:04,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:16:04,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1576044677, now seen corresponding path program 3 times [2020-11-29 18:16:04,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:16:04,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878847844] [2020-11-29 18:16:04,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:16:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:16:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:16:04,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878847844] [2020-11-29 18:16:04,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:16:04,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 18:16:04,963 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532626653] [2020-11-29 18:16:04,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 18:16:04,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:16:04,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 18:16:04,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-29 18:16:04,964 INFO L87 Difference]: Start difference. First operand 386 states and 1083 transitions. Second operand 7 states. [2020-11-29 18:16:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:16:05,053 INFO L93 Difference]: Finished difference Result 533 states and 1470 transitions. [2020-11-29 18:16:05,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:16:05,054 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-11-29 18:16:05,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:16:05,055 INFO L225 Difference]: With dead ends: 533 [2020-11-29 18:16:05,055 INFO L226 Difference]: Without dead ends: 301 [2020-11-29 18:16:05,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-29 18:16:05,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2020-11-29 18:16:05,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2020-11-29 18:16:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2020-11-29 18:16:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 819 transitions. [2020-11-29 18:16:05,061 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 819 transitions. Word has length 27 [2020-11-29 18:16:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:16:05,062 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 819 transitions. [2020-11-29 18:16:05,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 18:16:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 819 transitions. [2020-11-29 18:16:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-29 18:16:05,063 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:16:05,063 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:16:05,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-29 18:16:05,063 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:16:05,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:16:05,064 INFO L82 PathProgramCache]: Analyzing trace with hash 28795947, now seen corresponding path program 4 times [2020-11-29 18:16:05,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:16:05,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625307656] [2020-11-29 18:16:05,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:16:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 18:16:05,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 18:16:05,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625307656] [2020-11-29 18:16:05,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 18:16:05,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 18:16:05,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062970534] [2020-11-29 18:16:05,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 18:16:05,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 18:16:05,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 18:16:05,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-29 18:16:05,201 INFO L87 Difference]: Start difference. First operand 301 states and 819 transitions. Second operand 7 states. [2020-11-29 18:16:05,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 18:16:05,286 INFO L93 Difference]: Finished difference Result 403 states and 1080 transitions. [2020-11-29 18:16:05,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 18:16:05,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-11-29 18:16:05,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 18:16:05,287 INFO L225 Difference]: With dead ends: 403 [2020-11-29 18:16:05,287 INFO L226 Difference]: Without dead ends: 136 [2020-11-29 18:16:05,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-29 18:16:05,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2020-11-29 18:16:05,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2020-11-29 18:16:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-11-29 18:16:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 319 transitions. [2020-11-29 18:16:05,290 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 319 transitions. Word has length 27 [2020-11-29 18:16:05,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 18:16:05,290 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 319 transitions. [2020-11-29 18:16:05,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 18:16:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 319 transitions. [2020-11-29 18:16:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-29 18:16:05,291 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 18:16:05,291 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 18:16:05,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-29 18:16:05,291 INFO L429 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 18:16:05,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 18:16:05,291 INFO L82 PathProgramCache]: Analyzing trace with hash -804012313, now seen corresponding path program 5 times [2020-11-29 18:16:05,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 18:16:05,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965841621] [2020-11-29 18:16:05,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 18:16:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:16:05,335 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:16:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 18:16:05,379 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 18:16:05,430 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 18:16:05,430 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 18:16:05,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-29 18:16:05,459 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,459 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,459 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,460 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [782] [2020-11-29 18:16:05,461 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,461 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,461 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,461 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,462 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,462 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,464 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,465 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,465 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,465 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,465 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,466 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,466 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,467 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,473 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,474 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,474 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,475 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,475 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,476 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,476 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,477 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,477 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,477 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,477 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,477 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,478 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,478 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,478 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,479 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,479 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,479 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:16:05 BasicIcfg [2020-11-29 18:16:05,570 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 18:16:05,571 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 18:16:05,571 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 18:16:05,571 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 18:16:05,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:15:44" (3/4) ... [2020-11-29 18:16:05,573 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 18:16:05,589 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,590 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,590 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,590 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [782] [2020-11-29 18:16:05,590 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,591 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,591 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,591 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,591 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,592 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,592 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,592 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,592 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,592 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,593 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,593 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,593 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,593 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,594 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,594 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,594 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,594 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,595 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,595 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,595 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,596 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,596 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,596 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,596 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,597 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,597 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,597 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,597 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,597 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,598 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,598 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,598 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,598 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,598 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,599 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,599 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,599 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,599 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,599 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,599 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,599 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-29 18:16:05,600 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 18:16:05,707 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a561cc08-f094-49c2-b0da-a0d152b493dd/bin/uautomizer/witness.graphml [2020-11-29 18:16:05,707 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 18:16:05,709 INFO L168 Benchmark]: Toolchain (without parser) took 24766.32 ms. Allocated memory was 94.4 MB in the beginning and 614.5 MB in the end (delta: 520.1 MB). Free memory was 62.7 MB in the beginning and 224.6 MB in the end (delta: -161.8 MB). Peak memory consumption was 357.5 MB. Max. memory is 16.1 GB. [2020-11-29 18:16:05,711 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 94.4 MB. Free memory is still 52.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 18:16:05,711 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.39 ms. Allocated memory was 94.4 MB in the beginning and 119.5 MB in the end (delta: 25.2 MB). Free memory was 62.5 MB in the beginning and 94.5 MB in the end (delta: -32.0 MB). Peak memory consumption was 19.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:16:05,712 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.69 ms. Allocated memory is still 119.5 MB. Free memory was 94.5 MB in the beginning and 92.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. [2020-11-29 18:16:05,712 INFO L168 Benchmark]: Boogie Preprocessor took 70.19 ms. Allocated memory is still 119.5 MB. Free memory was 92.6 MB in the beginning and 90.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 18:16:05,712 INFO L168 Benchmark]: RCFGBuilder took 3113.81 ms. Allocated memory was 119.5 MB in the beginning and 144.7 MB in the end (delta: 25.2 MB). Free memory was 89.6 MB in the beginning and 68.2 MB in the end (delta: 21.4 MB). Peak memory consumption was 71.5 MB. Max. memory is 16.1 GB. [2020-11-29 18:16:05,713 INFO L168 Benchmark]: TraceAbstraction took 20666.52 ms. Allocated memory was 144.7 MB in the beginning and 614.5 MB in the end (delta: 469.8 MB). Free memory was 67.1 MB in the beginning and 245.5 MB in the end (delta: -178.4 MB). Peak memory consumption was 291.4 MB. Max. memory is 16.1 GB. [2020-11-29 18:16:05,713 INFO L168 Benchmark]: Witness Printer took 136.64 ms. Allocated memory is still 614.5 MB. Free memory was 245.5 MB in the beginning and 224.6 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-29 18:16:05,717 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.28 ms. Allocated memory is still 94.4 MB. Free memory is still 52.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 696.39 ms. Allocated memory was 94.4 MB in the beginning and 119.5 MB in the end (delta: 25.2 MB). Free memory was 62.5 MB in the beginning and 94.5 MB in the end (delta: -32.0 MB). Peak memory consumption was 19.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 72.69 ms. Allocated memory is still 119.5 MB. Free memory was 94.5 MB in the beginning and 92.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 70.19 ms. Allocated memory is still 119.5 MB. Free memory was 92.6 MB in the beginning and 90.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3113.81 ms. Allocated memory was 119.5 MB in the beginning and 144.7 MB in the end (delta: 25.2 MB). Free memory was 89.6 MB in the beginning and 68.2 MB in the end (delta: 21.4 MB). Peak memory consumption was 71.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20666.52 ms. Allocated memory was 144.7 MB in the beginning and 614.5 MB in the end (delta: 469.8 MB). Free memory was 67.1 MB in the beginning and 245.5 MB in the end (delta: -178.4 MB). Peak memory consumption was 291.4 MB. Max. memory is 16.1 GB. * Witness Printer took 136.64 ms. Allocated memory is still 614.5 MB. Free memory was 245.5 MB in the beginning and 224.6 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1820 VarBasedMoverChecksPositive, 66 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 49 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 188 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.3s, 128 PlacesBefore, 46 PlacesAfterwards, 118 TransitionsBefore, 34 TransitionsAfterwards, 2754 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 104 TotalNumberOfCompositions, 7788 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L841] 0 pthread_t t1433; [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] 0 pthread_t t1434; [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] 0 pthread_t t1435; [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] 0 pthread_t t1436; [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "mix053_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 4 return 0; [L748] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L854] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L865] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L866] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L866] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L868] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L871] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L871] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L871] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix053_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.4s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.6s, HoareTripleCheckerStatistics: 1065 SDtfs, 1430 SDslu, 2822 SDs, 0 SdLazy, 1236 SolverSat, 278 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 2626 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 439 NumberOfCodeBlocks, 439 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 388 ConstructedInterpolants, 0 QuantifiedInterpolants, 78591 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...