./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix040_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_aa3eb494-387f-4a38-80e9-8b509a94b995/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_aa3eb494-387f-4a38-80e9-8b509a94b995/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_aa3eb494-387f-4a38-80e9-8b509a94b995/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_aa3eb494-387f-4a38-80e9-8b509a94b995/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_aa3eb494-387f-4a38-80e9-8b509a94b995/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_aa3eb494-387f-4a38-80e9-8b509a94b995/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 1fe53c1ead443ea41cec99d106a702db831e47b4 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 22:56:58,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 22:56:58,611 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 22:56:58,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 22:56:58,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 22:56:58,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 22:56:58,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 22:56:58,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 22:56:58,702 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 22:56:58,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 22:56:58,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 22:56:58,706 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 22:56:58,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 22:56:58,708 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 22:56:58,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 22:56:58,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 22:56:58,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 22:56:58,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 22:56:58,717 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 22:56:58,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 22:56:58,723 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 22:56:58,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 22:56:58,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 22:56:58,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 22:56:58,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 22:56:58,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 22:56:58,734 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 22:56:58,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 22:56:58,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 22:56:58,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 22:56:58,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 22:56:58,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 22:56:58,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 22:56:58,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 22:56:58,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 22:56:58,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 22:56:58,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 22:56:58,754 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 22:56:58,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 22:56:58,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 22:56:58,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 22:56:58,760 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_aa3eb494-387f-4a38-80e9-8b509a94b995/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 22:56:58,806 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 22:56:58,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 22:56:58,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 22:56:58,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 22:56:58,808 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 22:56:58,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 22:56:58,809 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 22:56:58,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 22:56:58,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 22:56:58,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 22:56:58,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 22:56:58,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 22:56:58,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 22:56:58,810 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 22:56:58,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 22:56:58,811 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 22:56:58,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 22:56:58,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 22:56:58,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 22:56:58,817 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 22:56:58,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 22:56:58,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 22:56:58,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 22:56:58,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 22:56:58,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 22:56:58,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 22:56:58,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 22:56:58,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 22:56:58,820 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 22:56:58,820 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_aa3eb494-387f-4a38-80e9-8b509a94b995/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_aa3eb494-387f-4a38-80e9-8b509a94b995/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 -> 1fe53c1ead443ea41cec99d106a702db831e47b4 [2020-11-29 22:56:59,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 22:56:59,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 22:56:59,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 22:56:59,133 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 22:56:59,134 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 22:56:59,135 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_aa3eb494-387f-4a38-80e9-8b509a94b995/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i [2020-11-29 22:56:59,206 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aa3eb494-387f-4a38-80e9-8b509a94b995/bin/uautomizer/data/6d32ad9e1/cf963397597a49349150c5ed8abd0792/FLAG3b7c83884 [2020-11-29 22:56:59,871 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 22:56:59,872 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_aa3eb494-387f-4a38-80e9-8b509a94b995/sv-benchmarks/c/pthread-wmm/mix040_tso.oepc.i [2020-11-29 22:56:59,887 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aa3eb494-387f-4a38-80e9-8b509a94b995/bin/uautomizer/data/6d32ad9e1/cf963397597a49349150c5ed8abd0792/FLAG3b7c83884 [2020-11-29 22:57:00,115 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_aa3eb494-387f-4a38-80e9-8b509a94b995/bin/uautomizer/data/6d32ad9e1/cf963397597a49349150c5ed8abd0792 [2020-11-29 22:57:00,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 22:57:00,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 22:57:00,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 22:57:00,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 22:57:00,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 22:57:00,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:57:00" (1/1) ... [2020-11-29 22:57:00,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63233ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:57:00, skipping insertion in model container [2020-11-29 22:57:00,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:57:00" (1/1) ... [2020-11-29 22:57:00,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 22:57:00,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 22:57:00,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 22:57:00,669 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 22:57:00,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 22:57:00,881 INFO L208 MainTranslator]: Completed translation [2020-11-29 22:57:00,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:57:00 WrapperNode [2020-11-29 22:57:00,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 22:57:00,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 22:57:00,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 22:57:00,883 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 22:57:00,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:57:00" (1/1) ... [2020-11-29 22:57:00,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:57:00" (1/1) ... [2020-11-29 22:57:00,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 22:57:00,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 22:57:00,967 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 22:57:00,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 22:57:00,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:57:00" (1/1) ... [2020-11-29 22:57:00,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:57:00" (1/1) ... [2020-11-29 22:57:00,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:57:00" (1/1) ... [2020-11-29 22:57:00,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:57:00" (1/1) ... [2020-11-29 22:57:00,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:57:00" (1/1) ... [2020-11-29 22:57:01,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:57:00" (1/1) ... [2020-11-29 22:57:01,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:57:00" (1/1) ... [2020-11-29 22:57:01,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 22:57:01,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 22:57:01,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 22:57:01,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 22:57:01,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:57:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aa3eb494-387f-4a38-80e9-8b509a94b995/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 22:57:01,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 22:57:01,135 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-29 22:57:01,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 22:57:01,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 22:57:01,136 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-29 22:57:01,137 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-29 22:57:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-29 22:57:01,138 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-29 22:57:01,138 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-29 22:57:01,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-29 22:57:01,139 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-29 22:57:01,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-29 22:57:01,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 22:57:01,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-29 22:57:01,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 22:57:01,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 22:57:01,142 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 22:57:04,363 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 22:57:04,363 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-29 22:57:04,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:57:04 BoogieIcfgContainer [2020-11-29 22:57:04,365 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 22:57:04,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 22:57:04,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 22:57:04,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 22:57:04,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 10:57:00" (1/3) ... [2020-11-29 22:57:04,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5deb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 10:57:04, skipping insertion in model container [2020-11-29 22:57:04,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:57:00" (2/3) ... [2020-11-29 22:57:04,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d5deb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 10:57:04, skipping insertion in model container [2020-11-29 22:57:04,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:57:04" (3/3) ... [2020-11-29 22:57:04,375 INFO L111 eAbstractionObserver]: Analyzing ICFG mix040_tso.oepc.i [2020-11-29 22:57:04,387 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-29 22:57:04,388 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 22:57:04,393 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 22:57:04,394 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-29 22:57:04,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,446 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,446 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,446 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,447 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,448 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,451 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,451 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,453 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,454 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,458 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,459 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,459 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,459 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,460 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,461 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,464 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,485 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,486 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,490 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,491 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,494 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,494 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,497 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,497 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,501 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,503 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,504 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,504 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 22:57:04,512 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-29 22:57:04,525 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-29 22:57:04,559 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 22:57:04,560 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 22:57:04,560 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 22:57:04,560 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 22:57:04,561 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 22:57:04,561 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 22:57:04,562 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 22:57:04,562 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 22:57:04,585 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-29 22:57:04,587 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 122 transitions, 264 flow [2020-11-29 22:57:04,591 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 122 transitions, 264 flow [2020-11-29 22:57:04,593 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 132 places, 122 transitions, 264 flow [2020-11-29 22:57:04,681 INFO L129 PetriNetUnfolder]: 3/118 cut-off events. [2020-11-29 22:57:04,681 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-29 22:57:04,688 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 118 events. 3/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2020-11-29 22:57:04,697 INFO L116 LiptonReduction]: Number of co-enabled transitions 2970 [2020-11-29 22:57:04,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:04,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:04,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:04,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:05,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:05,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:05,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:05,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:05,430 WARN L193 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-29 22:57:05,593 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-29 22:57:05,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:05,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:05,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:05,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:05,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:05,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:05,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:05,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:05,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:05,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:05,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:05,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:05,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:05,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:05,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:05,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:05,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:05,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:05,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:05,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:05,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:05,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:05,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:05,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:05,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 22:57:05,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:05,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:05,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:05,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:05,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:05,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:05,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:05,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:05,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:06,044 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:06,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:06,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:06,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:06,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:06,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:06,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:06,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:06,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:06,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:06,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:06,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:06,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:06,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:06,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:06,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:06,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:06,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:06,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:06,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:06,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:06,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:06,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:06,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:06,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:06,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:06,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:06,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:06,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:06,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:06,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:06,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:06,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:06,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:06,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:06,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:06,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:06,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:06,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:06,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:06,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:06,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:06,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:06,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:06,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:06,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:06,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:06,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:06,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:06,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:06,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:06,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:06,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:06,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:06,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:06,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:06,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:06,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:06,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:06,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:06,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:06,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:06,881 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:06,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:06,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,883 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:06,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:06,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:06,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:06,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:06,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:06,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:06,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:06,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:06,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:06,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:06,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:06,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:07,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:07,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:07,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:07,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:07,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:07,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:07,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:07,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:07,292 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-29 22:57:07,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:07,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:07,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:07,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:07,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-29 22:57:07,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:57:07,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-29 22:57:07,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:07,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:07,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:07,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 22:57:07,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:07,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 22:57:07,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:07,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 22:57:07,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:57:07,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 22:57:07,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:57:07,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 22:57:07,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:57:07,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-29 22:57:07,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:07,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-29 22:57:07,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:07,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-29 22:57:07,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:07,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:07,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:07,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:07,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:07,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:07,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:07,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:07,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:07,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:07,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:07,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:07,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:07,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:07,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:07,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:07,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:07,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:07,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:07,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:07,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:07,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:07,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:07,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:07,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:07,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:07,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:07,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:07,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:07,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:07,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:07,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:07,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:08,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 22:57:08,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:08,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:08,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:08,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:08,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:08,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:08,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:08,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:08,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:08,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:08,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:08,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:08,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:08,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:08,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:08,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:08,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:08,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:08,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:08,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:08,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:08,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:08,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:08,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:08,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:08,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:08,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:08,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:08,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:08,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:08,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:08,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:08,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:08,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:08,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:08,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 22:57:08,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:08,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 22:57:08,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:08,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 22:57:08,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:57:08,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 22:57:08,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:57:08,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-11-29 22:57:08,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:57:08,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-29 22:57:08,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:08,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-29 22:57:08,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:08,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-11-29 22:57:08,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:08,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-11-29 22:57:08,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:08,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:08,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:08,829 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-11-29 22:57:08,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-29 22:57:08,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-11-29 22:57:08,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:10,050 WARN L193 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 234 DAG size of output: 193 [2020-11-29 22:57:10,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-11-29 22:57:10,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:10,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:10,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:10,973 WARN L193 SmtUtils]: Spent 895.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 122 [2020-11-29 22:57:10,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 22:57:10,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:11,125 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-29 22:57:11,238 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-29 22:57:12,730 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 233 DAG size of output: 193 [2020-11-29 22:57:12,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-11-29 22:57:12,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:12,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-29 22:57:12,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:13,731 WARN L193 SmtUtils]: Spent 984.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2020-11-29 22:57:13,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:13,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:13,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:13,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:13,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:13,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:13,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:13,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:13,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:13,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:13,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:13,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:13,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:13,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:13,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:13,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,167 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-11-29 22:57:14,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:14,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:14,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:14,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 22:57:14,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 22:57:14,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 5, 4, 5, 2, 1] term [2020-11-29 22:57:14,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:57:14,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 5, 4, 5, 2, 1] term [2020-11-29 22:57:14,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 5, 4, 5, 2, 1] term [2020-11-29 22:57:14,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 5, 3, 2, 1] term [2020-11-29 22:57:14,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 5, 4, 5, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 5, 4, 5, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 5, 4, 5, 2, 1] term [2020-11-29 22:57:14,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 5, 4, 5, 4, 5, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 5, 4, 5, 4, 5, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-29 22:57:14,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:57:14,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-29 22:57:14,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 3, 8, 2, 2, 1] term [2020-11-29 22:57:14,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 3, 2, 1] term [2020-11-29 22:57:14,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 8, 3, 8, 3, 2, 2, 1] term [2020-11-29 22:57:14,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 8, 3, 8, 3, 8, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 5, 4, 5, 2, 1] term [2020-11-29 22:57:14,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:57:14,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 5, 4, 5, 2, 1] term [2020-11-29 22:57:14,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 5, 4, 5, 2, 1] term [2020-11-29 22:57:14,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 5, 3, 2, 1] term [2020-11-29 22:57:14,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 5, 4, 5, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 5, 4, 5, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 5, 4, 5, 2, 1] term [2020-11-29 22:57:14,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 5, 4, 5, 4, 5, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 5, 4, 5, 4, 5, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 5, 4, 5, 2, 1] term [2020-11-29 22:57:14,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 5, 3, 2, 1] term [2020-11-29 22:57:14,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:14,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 5, 4, 5, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 5, 4, 5, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 5, 4, 5, 2, 1] term [2020-11-29 22:57:14,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 5, 4, 5, 4, 5, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 5, 4, 5, 4, 5, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:14,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:14,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 5, 4, 5, 2, 1] term [2020-11-29 22:57:14,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:57:14,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 5, 4, 5, 2, 1] term [2020-11-29 22:57:14,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:15,176 WARN L193 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-11-29 22:57:15,521 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2020-11-29 22:57:15,757 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-29 22:57:15,925 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-29 22:57:15,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 5, 4, 5, 2, 1] term [2020-11-29 22:57:15,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 22:57:15,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 5, 4, 5, 2, 1] term [2020-11-29 22:57:15,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:15,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 5, 4, 5, 2, 1] term [2020-11-29 22:57:15,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:15,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 5, 3, 2, 1] term [2020-11-29 22:57:15,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:15,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:15,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:15,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:15,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 22:57:15,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 5, 4, 5, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:15,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:15,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 5, 4, 5, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:15,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:15,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 5, 4, 5, 2, 1] term [2020-11-29 22:57:15,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:15,974 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 5, 4, 5, 4, 5, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:15,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:15,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 5, 4, 5, 4, 5, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 22:57:15,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 22:57:16,567 WARN L193 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-11-29 22:57:16,788 WARN L193 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-11-29 22:57:16,795 INFO L131 LiptonReduction]: Checked pairs total: 8772 [2020-11-29 22:57:16,795 INFO L133 LiptonReduction]: Total number of compositions: 107 [2020-11-29 22:57:16,802 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2020-11-29 22:57:17,079 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-11-29 22:57:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-11-29 22:57:17,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-29 22:57:17,087 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:17,087 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:57:17,088 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 22:57:17,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:17,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2143638021, now seen corresponding path program 1 times [2020-11-29 22:57:17,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:17,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515747067] [2020-11-29 22:57:17,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:57:17,434 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 22:57:17,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515747067] [2020-11-29 22:57:17,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:57:17,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 22:57:17,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560006220] [2020-11-29 22:57:17,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 22:57:17,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:57:17,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 22:57:17,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 22:57:17,459 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-11-29 22:57:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:57:17,611 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-11-29 22:57:17,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 22:57:17,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-29 22:57:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:57:17,669 INFO L225 Difference]: With dead ends: 3250 [2020-11-29 22:57:17,670 INFO L226 Difference]: Without dead ends: 2650 [2020-11-29 22:57:17,671 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 22:57:17,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-11-29 22:57:17,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-11-29 22:57:17,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-11-29 22:57:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-11-29 22:57:17,960 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-11-29 22:57:17,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:57:17,961 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-11-29 22:57:17,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 22:57:17,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-11-29 22:57:17,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-29 22:57:17,967 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:17,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:57:17,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 22:57:17,968 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 22:57:17,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:17,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1667390333, now seen corresponding path program 1 times [2020-11-29 22:57:17,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:17,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742313613] [2020-11-29 22:57:17,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:57:18,145 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 22:57:18,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742313613] [2020-11-29 22:57:18,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:57:18,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 22:57:18,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503268444] [2020-11-29 22:57:18,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 22:57:18,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:57:18,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 22:57:18,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 22:57:18,148 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-11-29 22:57:18,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:57:18,226 INFO L93 Difference]: Finished difference Result 2638 states and 10170 transitions. [2020-11-29 22:57:18,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 22:57:18,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-29 22:57:18,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:57:18,256 INFO L225 Difference]: With dead ends: 2638 [2020-11-29 22:57:18,256 INFO L226 Difference]: Without dead ends: 2638 [2020-11-29 22:57:18,257 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 22:57:18,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2638 states. [2020-11-29 22:57:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2638 to 2638. [2020-11-29 22:57:18,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2638 states. [2020-11-29 22:57:18,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 10170 transitions. [2020-11-29 22:57:18,399 INFO L78 Accepts]: Start accepts. Automaton has 2638 states and 10170 transitions. Word has length 11 [2020-11-29 22:57:18,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:57:18,399 INFO L481 AbstractCegarLoop]: Abstraction has 2638 states and 10170 transitions. [2020-11-29 22:57:18,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 22:57:18,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 10170 transitions. [2020-11-29 22:57:18,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 22:57:18,403 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:18,403 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:57:18,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 22:57:18,404 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 22:57:18,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:18,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1822771823, now seen corresponding path program 1 times [2020-11-29 22:57:18,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:18,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668751540] [2020-11-29 22:57:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:57:18,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 22:57:18,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668751540] [2020-11-29 22:57:18,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:57:18,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 22:57:18,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582742773] [2020-11-29 22:57:18,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 22:57:18,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:57:18,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 22:57:18,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 22:57:18,480 INFO L87 Difference]: Start difference. First operand 2638 states and 10170 transitions. Second operand 3 states. [2020-11-29 22:57:18,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:57:18,529 INFO L93 Difference]: Finished difference Result 2442 states and 9320 transitions. [2020-11-29 22:57:18,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 22:57:18,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-29 22:57:18,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:57:18,560 INFO L225 Difference]: With dead ends: 2442 [2020-11-29 22:57:18,560 INFO L226 Difference]: Without dead ends: 2442 [2020-11-29 22:57:18,561 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 22:57:18,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2020-11-29 22:57:18,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2442. [2020-11-29 22:57:18,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2442 states. [2020-11-29 22:57:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9320 transitions. [2020-11-29 22:57:18,679 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 9320 transitions. Word has length 12 [2020-11-29 22:57:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:57:18,679 INFO L481 AbstractCegarLoop]: Abstraction has 2442 states and 9320 transitions. [2020-11-29 22:57:18,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 22:57:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 9320 transitions. [2020-11-29 22:57:18,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 22:57:18,687 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:18,687 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:57:18,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 22:57:18,688 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 22:57:18,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:18,689 INFO L82 PathProgramCache]: Analyzing trace with hash 662942690, now seen corresponding path program 1 times [2020-11-29 22:57:18,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:18,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579444223] [2020-11-29 22:57:18,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:57:18,988 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 22:57:18,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579444223] [2020-11-29 22:57:18,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:57:18,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 22:57:18,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824446141] [2020-11-29 22:57:18,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 22:57:18,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:57:18,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 22:57:18,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 22:57:18,990 INFO L87 Difference]: Start difference. First operand 2442 states and 9320 transitions. Second operand 4 states. [2020-11-29 22:57:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:57:19,115 INFO L93 Difference]: Finished difference Result 2418 states and 9214 transitions. [2020-11-29 22:57:19,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 22:57:19,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-11-29 22:57:19,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:57:19,144 INFO L225 Difference]: With dead ends: 2418 [2020-11-29 22:57:19,144 INFO L226 Difference]: Without dead ends: 2418 [2020-11-29 22:57:19,144 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-29 22:57:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2020-11-29 22:57:19,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2418. [2020-11-29 22:57:19,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2020-11-29 22:57:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 9214 transitions. [2020-11-29 22:57:19,256 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 9214 transitions. Word has length 14 [2020-11-29 22:57:19,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:57:19,257 INFO L481 AbstractCegarLoop]: Abstraction has 2418 states and 9214 transitions. [2020-11-29 22:57:19,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 22:57:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 9214 transitions. [2020-11-29 22:57:19,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-29 22:57:19,260 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:19,260 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:57:19,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 22:57:19,261 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 22:57:19,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:19,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1193597727, now seen corresponding path program 1 times [2020-11-29 22:57:19,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:19,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640685622] [2020-11-29 22:57:19,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:57:19,362 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 22:57:19,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640685622] [2020-11-29 22:57:19,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:57:19,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 22:57:19,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015540151] [2020-11-29 22:57:19,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 22:57:19,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:57:19,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 22:57:19,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 22:57:19,364 INFO L87 Difference]: Start difference. First operand 2418 states and 9214 transitions. Second operand 3 states. [2020-11-29 22:57:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:57:19,410 INFO L93 Difference]: Finished difference Result 2386 states and 9070 transitions. [2020-11-29 22:57:19,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 22:57:19,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2020-11-29 22:57:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:57:19,462 INFO L225 Difference]: With dead ends: 2386 [2020-11-29 22:57:19,463 INFO L226 Difference]: Without dead ends: 2386 [2020-11-29 22:57:19,463 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 22:57:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2020-11-29 22:57:19,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2386. [2020-11-29 22:57:19,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2020-11-29 22:57:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 9070 transitions. [2020-11-29 22:57:19,568 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 9070 transitions. Word has length 14 [2020-11-29 22:57:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:57:19,569 INFO L481 AbstractCegarLoop]: Abstraction has 2386 states and 9070 transitions. [2020-11-29 22:57:19,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 22:57:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 9070 transitions. [2020-11-29 22:57:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 22:57:19,573 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:19,574 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:57:19,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 22:57:19,574 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 22:57:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:19,575 INFO L82 PathProgramCache]: Analyzing trace with hash -188821229, now seen corresponding path program 1 times [2020-11-29 22:57:19,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:19,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116742131] [2020-11-29 22:57:19,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:57:19,826 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 22:57:19,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116742131] [2020-11-29 22:57:19,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:57:19,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 22:57:19,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846607571] [2020-11-29 22:57:19,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 22:57:19,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:57:19,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 22:57:19,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 22:57:19,828 INFO L87 Difference]: Start difference. First operand 2386 states and 9070 transitions. Second operand 5 states. [2020-11-29 22:57:20,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:57:20,029 INFO L93 Difference]: Finished difference Result 2458 states and 9334 transitions. [2020-11-29 22:57:20,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 22:57:20,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-29 22:57:20,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:57:20,047 INFO L225 Difference]: With dead ends: 2458 [2020-11-29 22:57:20,047 INFO L226 Difference]: Without dead ends: 2458 [2020-11-29 22:57:20,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:57:20,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2458 states. [2020-11-29 22:57:20,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2458 to 2458. [2020-11-29 22:57:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2458 states. [2020-11-29 22:57:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2458 states to 2458 states and 9334 transitions. [2020-11-29 22:57:20,181 INFO L78 Accepts]: Start accepts. Automaton has 2458 states and 9334 transitions. Word has length 15 [2020-11-29 22:57:20,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:57:20,181 INFO L481 AbstractCegarLoop]: Abstraction has 2458 states and 9334 transitions. [2020-11-29 22:57:20,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 22:57:20,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2458 states and 9334 transitions. [2020-11-29 22:57:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 22:57:20,186 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:20,186 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:57:20,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 22:57:20,187 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 22:57:20,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:20,188 INFO L82 PathProgramCache]: Analyzing trace with hash -926427164, now seen corresponding path program 1 times [2020-11-29 22:57:20,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:20,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437057819] [2020-11-29 22:57:20,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:57:20,361 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 22:57:20,361 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437057819] [2020-11-29 22:57:20,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:57:20,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 22:57:20,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193150171] [2020-11-29 22:57:20,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 22:57:20,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:57:20,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 22:57:20,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 22:57:20,363 INFO L87 Difference]: Start difference. First operand 2458 states and 9334 transitions. Second operand 5 states. [2020-11-29 22:57:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:57:20,499 INFO L93 Difference]: Finished difference Result 2498 states and 9488 transitions. [2020-11-29 22:57:20,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 22:57:20,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-29 22:57:20,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:57:20,516 INFO L225 Difference]: With dead ends: 2498 [2020-11-29 22:57:20,516 INFO L226 Difference]: Without dead ends: 2498 [2020-11-29 22:57:20,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:57:20,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2020-11-29 22:57:20,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2482. [2020-11-29 22:57:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2482 states. [2020-11-29 22:57:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 9420 transitions. [2020-11-29 22:57:20,644 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 9420 transitions. Word has length 15 [2020-11-29 22:57:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:57:20,644 INFO L481 AbstractCegarLoop]: Abstraction has 2482 states and 9420 transitions. [2020-11-29 22:57:20,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 22:57:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 9420 transitions. [2020-11-29 22:57:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 22:57:20,649 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:20,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:57:20,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 22:57:20,649 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 22:57:20,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:20,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1022950004, now seen corresponding path program 2 times [2020-11-29 22:57:20,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:20,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586140396] [2020-11-29 22:57:20,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:57:20,798 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 22:57:20,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586140396] [2020-11-29 22:57:20,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:57:20,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 22:57:20,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525088355] [2020-11-29 22:57:20,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 22:57:20,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:57:20,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 22:57:20,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 22:57:20,801 INFO L87 Difference]: Start difference. First operand 2482 states and 9420 transitions. Second operand 5 states. [2020-11-29 22:57:20,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:57:20,941 INFO L93 Difference]: Finished difference Result 2450 states and 9288 transitions. [2020-11-29 22:57:20,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 22:57:20,942 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-29 22:57:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:57:20,956 INFO L225 Difference]: With dead ends: 2450 [2020-11-29 22:57:20,957 INFO L226 Difference]: Without dead ends: 2450 [2020-11-29 22:57:20,957 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:57:20,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2020-11-29 22:57:21,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2410. [2020-11-29 22:57:21,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2410 states. [2020-11-29 22:57:21,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2410 states to 2410 states and 9134 transitions. [2020-11-29 22:57:21,064 INFO L78 Accepts]: Start accepts. Automaton has 2410 states and 9134 transitions. Word has length 15 [2020-11-29 22:57:21,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:57:21,065 INFO L481 AbstractCegarLoop]: Abstraction has 2410 states and 9134 transitions. [2020-11-29 22:57:21,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 22:57:21,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2410 states and 9134 transitions. [2020-11-29 22:57:21,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-29 22:57:21,073 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:21,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:57:21,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 22:57:21,073 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 22:57:21,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:21,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1561304877, now seen corresponding path program 1 times [2020-11-29 22:57:21,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:21,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816183605] [2020-11-29 22:57:21,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:57:21,299 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 22:57:21,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816183605] [2020-11-29 22:57:21,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:57:21,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 22:57:21,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376102399] [2020-11-29 22:57:21,300 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 22:57:21,300 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:57:21,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 22:57:21,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:57:21,301 INFO L87 Difference]: Start difference. First operand 2410 states and 9134 transitions. Second operand 6 states. [2020-11-29 22:57:21,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:57:21,543 INFO L93 Difference]: Finished difference Result 2970 states and 11170 transitions. [2020-11-29 22:57:21,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 22:57:21,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-29 22:57:21,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:57:21,560 INFO L225 Difference]: With dead ends: 2970 [2020-11-29 22:57:21,560 INFO L226 Difference]: Without dead ends: 2970 [2020-11-29 22:57:21,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:57:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2970 states. [2020-11-29 22:57:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2970 to 2922. [2020-11-29 22:57:21,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2922 states. [2020-11-29 22:57:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 11022 transitions. [2020-11-29 22:57:21,683 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 11022 transitions. Word has length 16 [2020-11-29 22:57:21,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:57:21,684 INFO L481 AbstractCegarLoop]: Abstraction has 2922 states and 11022 transitions. [2020-11-29 22:57:21,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 22:57:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 11022 transitions. [2020-11-29 22:57:21,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-29 22:57:21,691 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:21,691 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 22:57:21,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 22:57:21,692 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 22:57:21,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:21,692 INFO L82 PathProgramCache]: Analyzing trace with hash 284956308, now seen corresponding path program 1 times [2020-11-29 22:57:21,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:21,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987436304] [2020-11-29 22:57:21,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:57:21,823 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 22:57:21,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987436304] [2020-11-29 22:57:21,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:57:21,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 22:57:21,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736688593] [2020-11-29 22:57:21,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 22:57:21,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:57:21,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 22:57:21,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 22:57:21,824 INFO L87 Difference]: Start difference. First operand 2922 states and 11022 transitions. Second operand 4 states. [2020-11-29 22:57:21,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:57:21,883 INFO L93 Difference]: Finished difference Result 3046 states and 10495 transitions. [2020-11-29 22:57:21,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 22:57:21,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-11-29 22:57:21,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:57:21,895 INFO L225 Difference]: With dead ends: 3046 [2020-11-29 22:57:21,895 INFO L226 Difference]: Without dead ends: 2254 [2020-11-29 22:57:21,895 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 22:57:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2020-11-29 22:57:21,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2254. [2020-11-29 22:57:21,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2020-11-29 22:57:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 7682 transitions. [2020-11-29 22:57:21,979 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 7682 transitions. Word has length 17 [2020-11-29 22:57:21,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:57:21,981 INFO L481 AbstractCegarLoop]: Abstraction has 2254 states and 7682 transitions. [2020-11-29 22:57:21,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 22:57:21,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 7682 transitions. [2020-11-29 22:57:21,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-29 22:57:21,987 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:21,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 22:57:21,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 22:57:21,988 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 22:57:21,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:21,988 INFO L82 PathProgramCache]: Analyzing trace with hash -834234027, now seen corresponding path program 1 times [2020-11-29 22:57:21,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:21,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653425992] [2020-11-29 22:57:21,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:57:22,106 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 22:57:22,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653425992] [2020-11-29 22:57:22,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:57:22,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 22:57:22,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771150095] [2020-11-29 22:57:22,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 22:57:22,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:57:22,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 22:57:22,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 22:57:22,108 INFO L87 Difference]: Start difference. First operand 2254 states and 7682 transitions. Second operand 5 states. [2020-11-29 22:57:22,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:57:22,198 INFO L93 Difference]: Finished difference Result 1950 states and 6149 transitions. [2020-11-29 22:57:22,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 22:57:22,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-11-29 22:57:22,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:57:22,206 INFO L225 Difference]: With dead ends: 1950 [2020-11-29 22:57:22,207 INFO L226 Difference]: Without dead ends: 1461 [2020-11-29 22:57:22,207 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-29 22:57:22,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-11-29 22:57:22,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1461. [2020-11-29 22:57:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1461 states. [2020-11-29 22:57:22,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 4510 transitions. [2020-11-29 22:57:22,256 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 4510 transitions. Word has length 18 [2020-11-29 22:57:22,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:57:22,256 INFO L481 AbstractCegarLoop]: Abstraction has 1461 states and 4510 transitions. [2020-11-29 22:57:22,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 22:57:22,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 4510 transitions. [2020-11-29 22:57:22,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 22:57:22,260 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:22,261 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 22:57:22,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 22:57:22,261 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 22:57:22,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:22,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1930861378, now seen corresponding path program 1 times [2020-11-29 22:57:22,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:22,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231453303] [2020-11-29 22:57:22,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:57:22,322 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 22:57:22,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231453303] [2020-11-29 22:57:22,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:57:22,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 22:57:22,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521498527] [2020-11-29 22:57:22,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 22:57:22,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:57:22,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 22:57:22,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 22:57:22,324 INFO L87 Difference]: Start difference. First operand 1461 states and 4510 transitions. Second operand 3 states. [2020-11-29 22:57:22,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:57:22,347 INFO L93 Difference]: Finished difference Result 2123 states and 6381 transitions. [2020-11-29 22:57:22,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 22:57:22,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-11-29 22:57:22,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:57:22,353 INFO L225 Difference]: With dead ends: 2123 [2020-11-29 22:57:22,353 INFO L226 Difference]: Without dead ends: 1473 [2020-11-29 22:57:22,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 22:57:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-11-29 22:57:22,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1365. [2020-11-29 22:57:22,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2020-11-29 22:57:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3967 transitions. [2020-11-29 22:57:22,403 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3967 transitions. Word has length 20 [2020-11-29 22:57:22,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:57:22,403 INFO L481 AbstractCegarLoop]: Abstraction has 1365 states and 3967 transitions. [2020-11-29 22:57:22,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 22:57:22,404 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3967 transitions. [2020-11-29 22:57:22,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 22:57:22,407 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:22,407 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] [2020-11-29 22:57:22,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 22:57:22,408 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 22:57:22,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:22,408 INFO L82 PathProgramCache]: Analyzing trace with hash -253002178, now seen corresponding path program 1 times [2020-11-29 22:57:22,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:22,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142066167] [2020-11-29 22:57:22,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:57:22,522 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 22:57:22,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142066167] [2020-11-29 22:57:22,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:57:22,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 22:57:22,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050232803] [2020-11-29 22:57:22,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 22:57:22,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:57:22,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 22:57:22,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 22:57:22,524 INFO L87 Difference]: Start difference. First operand 1365 states and 3967 transitions. Second operand 6 states. [2020-11-29 22:57:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:57:22,621 INFO L93 Difference]: Finished difference Result 1203 states and 3454 transitions. [2020-11-29 22:57:22,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 22:57:22,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-11-29 22:57:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:57:22,627 INFO L225 Difference]: With dead ends: 1203 [2020-11-29 22:57:22,632 INFO L226 Difference]: Without dead ends: 1055 [2020-11-29 22:57:22,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:57:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2020-11-29 22:57:22,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 927. [2020-11-29 22:57:22,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2020-11-29 22:57:22,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2691 transitions. [2020-11-29 22:57:22,691 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2691 transitions. Word has length 21 [2020-11-29 22:57:22,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:57:22,691 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 2691 transitions. [2020-11-29 22:57:22,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 22:57:22,691 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2691 transitions. [2020-11-29 22:57:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-29 22:57:22,695 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:22,695 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] [2020-11-29 22:57:22,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 22:57:22,695 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 22:57:22,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:22,696 INFO L82 PathProgramCache]: Analyzing trace with hash 341033224, now seen corresponding path program 1 times [2020-11-29 22:57:22,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:22,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845085917] [2020-11-29 22:57:22,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:57:23,079 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 26 [2020-11-29 22:57:23,202 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 29 [2020-11-29 22:57:23,375 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 22:57:23,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845085917] [2020-11-29 22:57:23,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:57:23,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 22:57:23,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523838564] [2020-11-29 22:57:23,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 22:57:23,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:57:23,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 22:57:23,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-29 22:57:23,378 INFO L87 Difference]: Start difference. First operand 927 states and 2691 transitions. Second operand 8 states. [2020-11-29 22:57:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:57:23,628 INFO L93 Difference]: Finished difference Result 1359 states and 3754 transitions. [2020-11-29 22:57:23,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 22:57:23,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-11-29 22:57:23,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:57:23,632 INFO L225 Difference]: With dead ends: 1359 [2020-11-29 22:57:23,632 INFO L226 Difference]: Without dead ends: 1101 [2020-11-29 22:57:23,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:57:23,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2020-11-29 22:57:23,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 963. [2020-11-29 22:57:23,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2020-11-29 22:57:23,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2710 transitions. [2020-11-29 22:57:23,665 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2710 transitions. Word has length 24 [2020-11-29 22:57:23,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:57:23,666 INFO L481 AbstractCegarLoop]: Abstraction has 963 states and 2710 transitions. [2020-11-29 22:57:23,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 22:57:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2710 transitions. [2020-11-29 22:57:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-29 22:57:23,670 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:23,670 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] [2020-11-29 22:57:23,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 22:57:23,670 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 22:57:23,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:23,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1234111033, now seen corresponding path program 1 times [2020-11-29 22:57:23,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:23,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567530717] [2020-11-29 22:57:23,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:57:23,734 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 22:57:23,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567530717] [2020-11-29 22:57:23,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:57:23,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 22:57:23,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325072674] [2020-11-29 22:57:23,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 22:57:23,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:57:23,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 22:57:23,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 22:57:23,736 INFO L87 Difference]: Start difference. First operand 963 states and 2710 transitions. Second operand 4 states. [2020-11-29 22:57:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:57:23,763 INFO L93 Difference]: Finished difference Result 1293 states and 3536 transitions. [2020-11-29 22:57:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 22:57:23,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-11-29 22:57:23,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:57:23,767 INFO L225 Difference]: With dead ends: 1293 [2020-11-29 22:57:23,767 INFO L226 Difference]: Without dead ends: 818 [2020-11-29 22:57:23,769 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 22:57:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2020-11-29 22:57:23,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 815. [2020-11-29 22:57:23,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2020-11-29 22:57:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 2149 transitions. [2020-11-29 22:57:23,801 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 2149 transitions. Word has length 24 [2020-11-29 22:57:23,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:57:23,801 INFO L481 AbstractCegarLoop]: Abstraction has 815 states and 2149 transitions. [2020-11-29 22:57:23,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 22:57:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 2149 transitions. [2020-11-29 22:57:23,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-29 22:57:23,806 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:23,807 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] [2020-11-29 22:57:23,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 22:57:23,807 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 22:57:23,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:23,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1637141396, now seen corresponding path program 2 times [2020-11-29 22:57:23,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:23,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380461257] [2020-11-29 22:57:23,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:57:23,968 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 22:57:23,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380461257] [2020-11-29 22:57:23,968 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:57:23,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 22:57:23,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064358140] [2020-11-29 22:57:23,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 22:57:23,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:57:23,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 22:57:23,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-29 22:57:23,969 INFO L87 Difference]: Start difference. First operand 815 states and 2149 transitions. Second operand 7 states. [2020-11-29 22:57:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:57:24,084 INFO L93 Difference]: Finished difference Result 783 states and 2085 transitions. [2020-11-29 22:57:24,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 22:57:24,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-11-29 22:57:24,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:57:24,086 INFO L225 Difference]: With dead ends: 783 [2020-11-29 22:57:24,086 INFO L226 Difference]: Without dead ends: 240 [2020-11-29 22:57:24,086 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-11-29 22:57:24,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2020-11-29 22:57:24,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 216. [2020-11-29 22:57:24,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-11-29 22:57:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 539 transitions. [2020-11-29 22:57:24,093 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 539 transitions. Word has length 24 [2020-11-29 22:57:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:57:24,094 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 539 transitions. [2020-11-29 22:57:24,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 22:57:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 539 transitions. [2020-11-29 22:57:24,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-29 22:57:24,095 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:24,095 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 22:57:24,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-29 22:57:24,095 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 22:57:24,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:24,096 INFO L82 PathProgramCache]: Analyzing trace with hash -282335607, now seen corresponding path program 1 times [2020-11-29 22:57:24,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:24,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894890564] [2020-11-29 22:57:24,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 22:57:24,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 22:57:24,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894890564] [2020-11-29 22:57:24,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 22:57:24,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 22:57:24,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797133182] [2020-11-29 22:57:24,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 22:57:24,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 22:57:24,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 22:57:24,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:57:24,698 INFO L87 Difference]: Start difference. First operand 216 states and 539 transitions. Second operand 9 states. [2020-11-29 22:57:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 22:57:24,891 INFO L93 Difference]: Finished difference Result 242 states and 593 transitions. [2020-11-29 22:57:24,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 22:57:24,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-11-29 22:57:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 22:57:24,893 INFO L225 Difference]: With dead ends: 242 [2020-11-29 22:57:24,893 INFO L226 Difference]: Without dead ends: 192 [2020-11-29 22:57:24,893 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-29 22:57:24,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-11-29 22:57:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 168. [2020-11-29 22:57:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-11-29 22:57:24,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 415 transitions. [2020-11-29 22:57:24,898 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 415 transitions. Word has length 27 [2020-11-29 22:57:24,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 22:57:24,898 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 415 transitions. [2020-11-29 22:57:24,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 22:57:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 415 transitions. [2020-11-29 22:57:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-29 22:57:24,899 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 22:57:24,899 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 22:57:24,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-29 22:57:24,900 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 22:57:24,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 22:57:24,901 INFO L82 PathProgramCache]: Analyzing trace with hash 803743881, now seen corresponding path program 2 times [2020-11-29 22:57:24,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 22:57:24,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907371415] [2020-11-29 22:57:24,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 22:57:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:57:24,956 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:57:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 22:57:25,007 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 22:57:25,044 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 22:57:25,045 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 22:57:25,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-29 22:57:25,046 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-29 22:57:25,066 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1108] [1108] L3-->L869: Formula: (let ((.cse7 (= (mod ~y$w_buff1_used~0_In6243261 256) 0)) (.cse6 (= (mod ~y$r_buff1_thd0~0_In6243261 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In6243261 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In6243261 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~y$r_buff0_thd0~0_In6243261 ~y$r_buff0_thd0~0_Out6243261) (or (and .cse0 (= ~y$w_buff0_used~0_In6243261 ~y$w_buff0_used~0_Out6243261)) (and .cse1 .cse2 (= ~y$w_buff0_used~0_Out6243261 0))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In6243261 0)) (= ~y$r_buff1_thd0~0_In6243261 ~y$r_buff1_thd0~0_Out6243261) (or (and .cse0 (or (and (= ~y~0_In6243261 ~y~0_Out6243261) .cse3) (and .cse4 .cse5 (= ~y~0_Out6243261 ~y$w_buff1~0_In6243261)))) (and .cse1 .cse2 (= ~y$w_buff0~0_In6243261 ~y~0_Out6243261))) (or (and .cse3 (= ~y$w_buff1_used~0_In6243261 ~y$w_buff1_used~0_Out6243261)) (and (= ~y$w_buff1_used~0_Out6243261 0) .cse4 .cse5))))) InVars {ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In6243261, ~y$w_buff0_used~0=~y$w_buff0_used~0_In6243261, ~y$w_buff1~0=~y$w_buff1~0_In6243261, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In6243261, ~y$w_buff0~0=~y$w_buff0~0_In6243261, ~y~0=~y~0_In6243261, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In6243261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In6243261} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out6243261, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out6243261|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out6243261|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out6243261|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out6243261|, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out6243261|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out6243261|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In6243261, ~y$w_buff1~0=~y$w_buff1~0_In6243261, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out6243261, ~y$w_buff0~0=~y$w_buff0~0_In6243261, ~y~0=~y~0_Out6243261, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out6243261, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out6243261} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~y~0, ULTIMATE.start_main_#t~ite32, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-11-29 22:57:25,071 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 22:57:25,071 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [786] [2020-11-29 22:57:25,073 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 22:57:25,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,073 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 22:57:25,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,074 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 22:57:25,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,074 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 22:57:25,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,074 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 22:57:25,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,076 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 22:57:25,076 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,076 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 22:57:25,077 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,077 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 22:57:25,077 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,077 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 22:57:25,077 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,077 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 22:57:25,078 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,078 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 22:57:25,078 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,079 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 22:57:25,079 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,079 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 22:57:25,079 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,079 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 22:57:25,079 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,080 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 22:57:25,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,080 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 22:57:25,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,081 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 22:57:25,081 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,081 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 22:57:25,081 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,082 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 22:57:25,082 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,082 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 22:57:25,082 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,082 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 22:57:25,082 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,083 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 22:57:25,083 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,083 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 22:57:25,083 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,083 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 22:57:25,083 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,084 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 22:57:25,084 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,084 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 22:57:25,084 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,084 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 22:57:25,084 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,085 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 22:57:25,085 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,085 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 22:57:25,085 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 10:57:25 BasicIcfg [2020-11-29 22:57:25,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 22:57:25,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 22:57:25,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 22:57:25,189 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 22:57:25,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:57:04" (3/4) ... [2020-11-29 22:57:25,196 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 22:57:25,213 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1108] [1108] L3-->L869: Formula: (let ((.cse7 (= (mod ~y$w_buff1_used~0_In6243261 256) 0)) (.cse6 (= (mod ~y$r_buff1_thd0~0_In6243261 256) 0)) (.cse8 (= (mod ~y$r_buff0_thd0~0_In6243261 256) 0)) (.cse9 (= (mod ~y$w_buff0_used~0_In6243261 256) 0))) (let ((.cse0 (or .cse8 .cse9)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~y$r_buff0_thd0~0_In6243261 ~y$r_buff0_thd0~0_Out6243261) (or (and .cse0 (= ~y$w_buff0_used~0_In6243261 ~y$w_buff0_used~0_Out6243261)) (and .cse1 .cse2 (= ~y$w_buff0_used~0_Out6243261 0))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In6243261 0)) (= ~y$r_buff1_thd0~0_In6243261 ~y$r_buff1_thd0~0_Out6243261) (or (and .cse0 (or (and (= ~y~0_In6243261 ~y~0_Out6243261) .cse3) (and .cse4 .cse5 (= ~y~0_Out6243261 ~y$w_buff1~0_In6243261)))) (and .cse1 .cse2 (= ~y$w_buff0~0_In6243261 ~y~0_Out6243261))) (or (and .cse3 (= ~y$w_buff1_used~0_In6243261 ~y$w_buff1_used~0_Out6243261)) (and (= ~y$w_buff1_used~0_Out6243261 0) .cse4 .cse5))))) InVars {ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In6243261, ~y$w_buff0_used~0=~y$w_buff0_used~0_In6243261, ~y$w_buff1~0=~y$w_buff1~0_In6243261, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In6243261, ~y$w_buff0~0=~y$w_buff0~0_In6243261, ~y~0=~y~0_In6243261, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In6243261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In6243261} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out6243261, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out6243261|, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out6243261|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out6243261|, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out6243261|, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out6243261|, ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out6243261|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In6243261, ~y$w_buff1~0=~y$w_buff1~0_In6243261, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out6243261, ~y$w_buff0~0=~y$w_buff0~0_In6243261, ~y~0=~y~0_Out6243261, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out6243261, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out6243261} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite29, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite31, ~y~0, ULTIMATE.start_main_#t~ite32, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-11-29 22:57:25,215 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 22:57:25,216 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [786] [2020-11-29 22:57:25,216 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 22:57:25,217 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,217 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 22:57:25,217 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,217 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 22:57:25,217 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,217 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 22:57:25,218 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,218 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 22:57:25,218 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,219 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 22:57:25,219 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,219 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 22:57:25,219 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,219 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 22:57:25,219 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,220 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 22:57:25,220 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,220 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 22:57:25,220 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,220 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 22:57:25,220 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,221 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 22:57:25,221 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,221 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 22:57:25,221 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,221 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 22:57:25,221 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,222 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 22:57:25,222 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,222 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 22:57:25,222 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,223 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 22:57:25,223 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,223 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 22:57:25,223 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,223 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 22:57:25,223 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,223 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 22:57:25,224 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,224 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 22:57:25,224 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,224 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 22:57:25,224 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,224 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 22:57:25,224 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,225 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 22:57:25,225 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,225 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 22:57:25,225 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,225 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 22:57:25,227 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,227 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 22:57:25,227 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,227 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 22:57:25,228 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,228 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 22:57:25,228 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 22:57:25,348 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_aa3eb494-387f-4a38-80e9-8b509a94b995/bin/uautomizer/witness.graphml [2020-11-29 22:57:25,349 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 22:57:25,350 INFO L168 Benchmark]: Toolchain (without parser) took 25230.20 ms. Allocated memory was 98.6 MB in the beginning and 394.3 MB in the end (delta: 295.7 MB). Free memory was 69.3 MB in the beginning and 247.3 MB in the end (delta: -178.0 MB). Peak memory consumption was 117.9 MB. Max. memory is 16.1 GB. [2020-11-29 22:57:25,351 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 98.6 MB. Free memory is still 58.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 22:57:25,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.48 ms. Allocated memory was 98.6 MB in the beginning and 121.6 MB in the end (delta: 23.1 MB). Free memory was 69.0 MB in the beginning and 97.5 MB in the end (delta: -28.5 MB). Peak memory consumption was 22.7 MB. Max. memory is 16.1 GB. [2020-11-29 22:57:25,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.80 ms. Allocated memory is still 121.6 MB. Free memory was 97.4 MB in the beginning and 95.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 22:57:25,352 INFO L168 Benchmark]: Boogie Preprocessor took 47.99 ms. Allocated memory is still 121.6 MB. Free memory was 95.6 MB in the beginning and 93.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 22:57:25,353 INFO L168 Benchmark]: RCFGBuilder took 3350.22 ms. Allocated memory was 121.6 MB in the beginning and 151.0 MB in the end (delta: 29.4 MB). Free memory was 93.5 MB in the beginning and 54.8 MB in the end (delta: 38.6 MB). Peak memory consumption was 67.8 MB. Max. memory is 16.1 GB. [2020-11-29 22:57:25,353 INFO L168 Benchmark]: TraceAbstraction took 20821.03 ms. Allocated memory was 151.0 MB in the beginning and 394.3 MB in the end (delta: 243.3 MB). Free memory was 54.8 MB in the beginning and 268.2 MB in the end (delta: -213.4 MB). Peak memory consumption was 30.9 MB. Max. memory is 16.1 GB. [2020-11-29 22:57:25,353 INFO L168 Benchmark]: Witness Printer took 160.14 ms. Allocated memory is still 394.3 MB. Free memory was 268.2 MB in the beginning and 247.3 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-29 22:57:25,356 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.24 ms. Allocated memory is still 98.6 MB. Free memory is still 58.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 760.48 ms. Allocated memory was 98.6 MB in the beginning and 121.6 MB in the end (delta: 23.1 MB). Free memory was 69.0 MB in the beginning and 97.5 MB in the end (delta: -28.5 MB). Peak memory consumption was 22.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 82.80 ms. Allocated memory is still 121.6 MB. Free memory was 97.4 MB in the beginning and 95.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 47.99 ms. Allocated memory is still 121.6 MB. Free memory was 95.6 MB in the beginning and 93.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3350.22 ms. Allocated memory was 121.6 MB in the beginning and 151.0 MB in the end (delta: 29.4 MB). Free memory was 93.5 MB in the beginning and 54.8 MB in the end (delta: 38.6 MB). Peak memory consumption was 67.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20821.03 ms. Allocated memory was 151.0 MB in the beginning and 394.3 MB in the end (delta: 243.3 MB). Free memory was 54.8 MB in the beginning and 268.2 MB in the end (delta: -213.4 MB). Peak memory consumption was 30.9 MB. Max. memory is 16.1 GB. * Witness Printer took 160.14 ms. Allocated memory is still 394.3 MB. Free memory was 268.2 MB in the beginning and 247.3 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 2089 VarBasedMoverChecksPositive, 92 VarBasedMoverChecksNegative, 30 SemBasedMoverChecksPositive, 62 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.8s, 194 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.2s, 132 PlacesBefore, 46 PlacesAfterwards, 122 TransitionsBefore, 34 TransitionsAfterwards, 2970 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 107 TotalNumberOfCompositions, 8772 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 __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L851] 0 pthread_t t1081; [L852] FCALL, FORK 0 pthread_create(&t1081, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L853] 0 pthread_t t1082; [L854] FCALL, FORK 0 pthread_create(&t1082, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L855] 0 pthread_t t1083; [L856] FCALL, FORK 0 pthread_create(&t1083, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L857] 0 pthread_t t1084; [L787] 3 y$w_buff1 = y$w_buff0 [L788] 3 y$w_buff0 = 2 [L789] 3 y$w_buff1_used = y$w_buff0_used [L790] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L792] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L793] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L794] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L795] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L796] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L858] FCALL, FORK 0 pthread_create(&t1084, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L800] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L817] 4 z = 1 [L820] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L826] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L829] 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) [L829] 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) [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L831] 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 [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L833] 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 [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L755] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L770] 2 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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] [L803] 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) [L803] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L803] 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) [L803] 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) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 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 [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 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 [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L773] 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) [L773] 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) [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L775] 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 [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 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 [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] 0 y$mem_tmp = y [L875] 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) [L875] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L875] 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) [L875] 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) [L876] 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)) [L876] 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) [L876] 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)) [L876] 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)) [L877] 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)) [L877] EXPR 0 !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) [L877] 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)) [L877] 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)) [L878] 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)) [L878] 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)) [L879] 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)) [L879] 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)) [L880] 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)) [L880] EXPR 0 !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) [L880] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L880] EXPR 0 !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) [L880] 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)) [L880] 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)) [L881] 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)) [L881] 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)) [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L883] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix040_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=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, 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, 120 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.4s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.5s, HoareTripleCheckerStatistics: 545 SDtfs, 838 SDslu, 991 SDs, 0 SdLazy, 392 SolverSat, 167 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.9s 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: 1.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 529 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 321 NumberOfCodeBlocks, 321 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 277 ConstructedInterpolants, 0 QuantifiedInterpolants, 54886 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...