./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix019_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix019_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7fa454f784fafc0976ec05146ed8d59c1b152b1 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5485861 [2020-10-26 00:16:35,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 00:16:35,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 00:16:35,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 00:16:35,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 00:16:35,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 00:16:35,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 00:16:35,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 00:16:35,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 00:16:35,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 00:16:35,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 00:16:35,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 00:16:35,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 00:16:35,722 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 00:16:35,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 00:16:35,725 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 00:16:35,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 00:16:35,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 00:16:35,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 00:16:35,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 00:16:35,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 00:16:35,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 00:16:35,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 00:16:35,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 00:16:35,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 00:16:35,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 00:16:35,744 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 00:16:35,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 00:16:35,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 00:16:35,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 00:16:35,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 00:16:35,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 00:16:35,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 00:16:35,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 00:16:35,753 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 00:16:35,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 00:16:35,754 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 00:16:35,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 00:16:35,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 00:16:35,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 00:16:35,758 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 00:16:35,759 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-26 00:16:35,794 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 00:16:35,795 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 00:16:35,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 00:16:35,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 00:16:35,798 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 00:16:35,798 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 00:16:35,799 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 00:16:35,799 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 00:16:35,799 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 00:16:35,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 00:16:35,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-26 00:16:35,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 00:16:35,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-26 00:16:35,801 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 00:16:35,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 00:16:35,802 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 00:16:35,802 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-26 00:16:35,802 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 00:16:35,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 00:16:35,803 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 00:16:35,803 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 00:16:35,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 00:16:35,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 00:16:35,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 00:16:35,805 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-26 00:16:35,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 00:16:35,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 00:16:35,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-26 00:16:35,806 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 00:16:35,806 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7fa454f784fafc0976ec05146ed8d59c1b152b1 [2020-10-26 00:16:36,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 00:16:36,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 00:16:36,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 00:16:36,330 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 00:16:36,331 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 00:16:36,333 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix019_power.oepc.i [2020-10-26 00:16:36,473 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e285993af/ce50d8eed5c246e281fc1925454bb7c3/FLAGee8e6b7c9 [2020-10-26 00:16:37,134 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 00:16:37,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix019_power.oepc.i [2020-10-26 00:16:37,157 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e285993af/ce50d8eed5c246e281fc1925454bb7c3/FLAGee8e6b7c9 [2020-10-26 00:16:37,407 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e285993af/ce50d8eed5c246e281fc1925454bb7c3 [2020-10-26 00:16:37,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 00:16:37,419 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 00:16:37,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 00:16:37,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 00:16:37,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 00:16:37,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:16:37" (1/1) ... [2020-10-26 00:16:37,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19606d0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:16:37, skipping insertion in model container [2020-10-26 00:16:37,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:16:37" (1/1) ... [2020-10-26 00:16:37,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 00:16:37,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 00:16:38,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:16:38,151 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 00:16:38,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:16:38,334 INFO L208 MainTranslator]: Completed translation [2020-10-26 00:16:38,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:16:38 WrapperNode [2020-10-26 00:16:38,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 00:16:38,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 00:16:38,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 00:16:38,337 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 00:16:38,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:16:38" (1/1) ... [2020-10-26 00:16:38,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:16:38" (1/1) ... [2020-10-26 00:16:38,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 00:16:38,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 00:16:38,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 00:16:38,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 00:16:38,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:16:38" (1/1) ... [2020-10-26 00:16:38,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:16:38" (1/1) ... [2020-10-26 00:16:38,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:16:38" (1/1) ... [2020-10-26 00:16:38,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:16:38" (1/1) ... [2020-10-26 00:16:38,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:16:38" (1/1) ... [2020-10-26 00:16:38,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:16:38" (1/1) ... [2020-10-26 00:16:38,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:16:38" (1/1) ... [2020-10-26 00:16:38,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 00:16:38,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 00:16:38,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 00:16:38,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 00:16:38,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:16:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-26 00:16:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 00:16:38,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-26 00:16:38,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 00:16:38,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 00:16:38,602 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-26 00:16:38,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-26 00:16:38,603 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-26 00:16:38,603 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-26 00:16:38,604 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-26 00:16:38,604 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-26 00:16:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 00:16:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-26 00:16:38,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 00:16:38,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 00:16:38,607 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-26 00:16:41,412 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 00:16:41,412 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-26 00:16:41,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:16:41 BoogieIcfgContainer [2020-10-26 00:16:41,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 00:16:41,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 00:16:41,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 00:16:41,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 00:16:41,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 12:16:37" (1/3) ... [2020-10-26 00:16:41,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f62c183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:16:41, skipping insertion in model container [2020-10-26 00:16:41,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:16:38" (2/3) ... [2020-10-26 00:16:41,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f62c183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:16:41, skipping insertion in model container [2020-10-26 00:16:41,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:16:41" (3/3) ... [2020-10-26 00:16:41,425 INFO L111 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc.i [2020-10-26 00:16:41,438 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-26 00:16:41,439 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-26 00:16:41,444 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-26 00:16:41,446 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-26 00:16:41,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,485 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,485 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,486 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,487 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,491 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,491 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,491 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,495 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,495 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,499 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,500 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,503 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,511 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,512 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,512 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,513 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,525 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,526 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,531 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,531 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,531 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,532 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,533 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,540 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,544 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,547 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:16:41,549 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-26 00:16:41,563 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-26 00:16:41,588 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 00:16:41,589 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-26 00:16:41,589 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-26 00:16:41,589 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 00:16:41,589 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 00:16:41,589 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 00:16:41,590 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 00:16:41,590 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 00:16:41,604 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-26 00:16:41,606 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 104 transitions, 223 flow [2020-10-26 00:16:41,610 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 104 transitions, 223 flow [2020-10-26 00:16:41,612 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 111 places, 104 transitions, 223 flow [2020-10-26 00:16:41,666 INFO L129 PetriNetUnfolder]: 3/101 cut-off events. [2020-10-26 00:16:41,666 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-26 00:16:41,671 INFO L80 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 3/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2020-10-26 00:16:41,675 INFO L116 LiptonReduction]: Number of co-enabled transitions 1962 [2020-10-26 00:16:41,993 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-10-26 00:16:42,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:42,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:42,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:42,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:42,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:42,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:42,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:42,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:42,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:42,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:42,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:42,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:42,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:42,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:42,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:42,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:42,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:42,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:42,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:42,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:42,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:42,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:42,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:42,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:42,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:42,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:42,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:42,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:42,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:42,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:42,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:42,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:42,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-26 00:16:42,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:42,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-26 00:16:42,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:43,356 WARN L193 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-26 00:16:43,489 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-26 00:16:43,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:43,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:43,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:43,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:43,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:43,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:43,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:43,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:43,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:43,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:43,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:43,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:43,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:43,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:43,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:43,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:43,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:43,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:43,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:16:43,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:16:44,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:16:44,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:16:44,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:16:44,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:16:44,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:16:44,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:44,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:16:44,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:44,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:16:44,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:44,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:16:44,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:16:44,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:16:44,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:44,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:44,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:44,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:44,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:44,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:44,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:44,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:44,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:44,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:44,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:44,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:44,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:44,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:44,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:44,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:44,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:44,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:44,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:44,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:44,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:44,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:44,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:16:44,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:16:44,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:16:44,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,567 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:16:44,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:16:44,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:16:44,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:16:44,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:16:44,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:16:44,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:16:44,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:44,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:16:44,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:44,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:16:44,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:44,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:44,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:44,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:44,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:44,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:44,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:44,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:44,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:44,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:44,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:44,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:44,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:44,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:44,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:44,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:44,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:44,912 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-26 00:16:45,045 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-26 00:16:45,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:45,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:45,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:45,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:45,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:45,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:45,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:45,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:16:45,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:16:45,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:16:45,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:16:45,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:16:45,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:16:45,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:16:45,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:45,235 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:16:45,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:45,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:16:45,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:45,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:16:45,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:16:45,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:16:45,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:45,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:45,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:45,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:45,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:45,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:45,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:45,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:45,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:45,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:45,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:45,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,576 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:45,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:45,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:45,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:45,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:45,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:45,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:45,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:45,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:45,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:45,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:16:45,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:16:45,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:16:45,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:16:45,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:16:45,888 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:16:45,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:16:45,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:16:45,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:16:45,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:16:45,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:45,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:16:45,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:45,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:16:45,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:45,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:45,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:45,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:45,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:45,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:45,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:45,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:45,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:46,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:46,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:46,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:46,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:46,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:46,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:46,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:46,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:16:46,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:46,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:46,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:46,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:16:46,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:16:46,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:46,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:16:46,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:16:46,266 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-10-26 00:16:46,881 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-26 00:16:47,013 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-10-26 00:16:47,540 WARN L193 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2020-10-26 00:16:47,819 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2020-10-26 00:16:47,838 INFO L131 LiptonReduction]: Checked pairs total: 5828 [2020-10-26 00:16:47,838 INFO L133 LiptonReduction]: Total number of compositions: 92 [2020-10-26 00:16:47,846 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2020-10-26 00:16:47,930 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1154 states. [2020-10-26 00:16:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states. [2020-10-26 00:16:47,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-26 00:16:47,938 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:16:47,939 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-26 00:16:47,941 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:16:47,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:16:47,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1100190, now seen corresponding path program 1 times [2020-10-26 00:16:47,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:16:47,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520945693] [2020-10-26 00:16:47,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:16:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:16:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:16:48,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520945693] [2020-10-26 00:16:48,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:16:48,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:16:48,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560394398] [2020-10-26 00:16:48,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:16:48,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:16:48,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:16:48,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:16:48,222 INFO L87 Difference]: Start difference. First operand 1154 states. Second operand 3 states. [2020-10-26 00:16:48,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:16:48,329 INFO L93 Difference]: Finished difference Result 962 states and 3090 transitions. [2020-10-26 00:16:48,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:16:48,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-26 00:16:48,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:16:48,362 INFO L225 Difference]: With dead ends: 962 [2020-10-26 00:16:48,362 INFO L226 Difference]: Without dead ends: 812 [2020-10-26 00:16:48,363 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-10-26 00:16:48,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-10-26 00:16:48,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2020-10-26 00:16:48,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-10-26 00:16:48,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2020-10-26 00:16:48,495 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 3 [2020-10-26 00:16:48,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:16:48,496 INFO L481 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2020-10-26 00:16:48,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:16:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2020-10-26 00:16:48,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-26 00:16:48,499 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:16:48,499 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:16:48,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 00:16:48,499 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:16:48,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:16:48,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1421988263, now seen corresponding path program 1 times [2020-10-26 00:16:48,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:16:48,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793299431] [2020-10-26 00:16:48,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:16:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:16:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:16:48,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793299431] [2020-10-26 00:16:48,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:16:48,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 00:16:48,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374938094] [2020-10-26 00:16:48,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:16:48,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:16:48,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:16:48,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:16:48,643 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand 4 states. [2020-10-26 00:16:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:16:48,680 INFO L93 Difference]: Finished difference Result 862 states and 2630 transitions. [2020-10-26 00:16:48,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:16:48,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-26 00:16:48,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:16:48,688 INFO L225 Difference]: With dead ends: 862 [2020-10-26 00:16:48,689 INFO L226 Difference]: Without dead ends: 712 [2020-10-26 00:16:48,690 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-10-26 00:16:48,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2020-10-26 00:16:48,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2020-10-26 00:16:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2020-10-26 00:16:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 2215 transitions. [2020-10-26 00:16:48,721 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 2215 transitions. Word has length 10 [2020-10-26 00:16:48,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:16:48,723 INFO L481 AbstractCegarLoop]: Abstraction has 712 states and 2215 transitions. [2020-10-26 00:16:48,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:16:48,723 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 2215 transitions. [2020-10-26 00:16:48,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-26 00:16:48,734 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:16:48,734 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:16:48,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 00:16:48,735 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:16:48,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:16:48,736 INFO L82 PathProgramCache]: Analyzing trace with hash 693843496, now seen corresponding path program 1 times [2020-10-26 00:16:48,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:16:48,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263456083] [2020-10-26 00:16:48,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:16:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:16:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:16:48,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263456083] [2020-10-26 00:16:48,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:16:48,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 00:16:48,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100489893] [2020-10-26 00:16:48,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:16:48,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:16:48,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:16:48,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:16:48,876 INFO L87 Difference]: Start difference. First operand 712 states and 2215 transitions. Second operand 4 states. [2020-10-26 00:16:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:16:48,917 INFO L93 Difference]: Finished difference Result 796 states and 2398 transitions. [2020-10-26 00:16:48,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:16:48,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-26 00:16:48,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:16:48,925 INFO L225 Difference]: With dead ends: 796 [2020-10-26 00:16:48,925 INFO L226 Difference]: Without dead ends: 696 [2020-10-26 00:16:48,925 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-10-26 00:16:48,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2020-10-26 00:16:48,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 696. [2020-10-26 00:16:48,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2020-10-26 00:16:48,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 2155 transitions. [2020-10-26 00:16:48,955 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 2155 transitions. Word has length 12 [2020-10-26 00:16:48,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:16:48,955 INFO L481 AbstractCegarLoop]: Abstraction has 696 states and 2155 transitions. [2020-10-26 00:16:48,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:16:48,956 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 2155 transitions. [2020-10-26 00:16:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-26 00:16:48,957 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:16:48,958 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:16:48,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 00:16:48,958 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:16:48,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:16:48,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1982411870, now seen corresponding path program 1 times [2020-10-26 00:16:48,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:16:48,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896730665] [2020-10-26 00:16:48,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:16:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:16:49,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:16:49,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896730665] [2020-10-26 00:16:49,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:16:49,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:16:49,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101153752] [2020-10-26 00:16:49,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:16:49,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:16:49,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:16:49,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:16:49,071 INFO L87 Difference]: Start difference. First operand 696 states and 2155 transitions. Second operand 4 states. [2020-10-26 00:16:49,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:16:49,159 INFO L93 Difference]: Finished difference Result 602 states and 1624 transitions. [2020-10-26 00:16:49,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:16:49,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-26 00:16:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:16:49,163 INFO L225 Difference]: With dead ends: 602 [2020-10-26 00:16:49,164 INFO L226 Difference]: Without dead ends: 452 [2020-10-26 00:16:49,164 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-10-26 00:16:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-10-26 00:16:49,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-10-26 00:16:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-10-26 00:16:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1179 transitions. [2020-10-26 00:16:49,179 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1179 transitions. Word has length 13 [2020-10-26 00:16:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:16:49,180 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1179 transitions. [2020-10-26 00:16:49,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:16:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1179 transitions. [2020-10-26 00:16:49,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-26 00:16:49,182 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:16:49,182 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:16:49,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 00:16:49,182 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:16:49,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:16:49,183 INFO L82 PathProgramCache]: Analyzing trace with hash -980787140, now seen corresponding path program 1 times [2020-10-26 00:16:49,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:16:49,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241748204] [2020-10-26 00:16:49,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:16:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:16:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:16:49,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241748204] [2020-10-26 00:16:49,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:16:49,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:16:49,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898334108] [2020-10-26 00:16:49,346 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:16:49,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:16:49,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:16:49,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:16:49,348 INFO L87 Difference]: Start difference. First operand 452 states and 1179 transitions. Second operand 4 states. [2020-10-26 00:16:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:16:49,393 INFO L93 Difference]: Finished difference Result 722 states and 1813 transitions. [2020-10-26 00:16:49,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:16:49,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-26 00:16:49,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:16:49,397 INFO L225 Difference]: With dead ends: 722 [2020-10-26 00:16:49,397 INFO L226 Difference]: Without dead ends: 482 [2020-10-26 00:16:49,398 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-10-26 00:16:49,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-10-26 00:16:49,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 440. [2020-10-26 00:16:49,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-26 00:16:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1095 transitions. [2020-10-26 00:16:49,414 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1095 transitions. Word has length 16 [2020-10-26 00:16:49,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:16:49,415 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1095 transitions. [2020-10-26 00:16:49,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:16:49,416 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1095 transitions. [2020-10-26 00:16:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-26 00:16:49,417 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:16:49,417 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:16:49,418 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 00:16:49,418 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:16:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:16:49,420 INFO L82 PathProgramCache]: Analyzing trace with hash 966184052, now seen corresponding path program 1 times [2020-10-26 00:16:49,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:16:49,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897159819] [2020-10-26 00:16:49,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:16:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:16:49,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:16:49,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897159819] [2020-10-26 00:16:49,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:16:49,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 00:16:49,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749174971] [2020-10-26 00:16:49,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 00:16:49,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:16:49,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 00:16:49,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:16:49,537 INFO L87 Difference]: Start difference. First operand 440 states and 1095 transitions. Second operand 5 states. [2020-10-26 00:16:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:16:49,603 INFO L93 Difference]: Finished difference Result 332 states and 749 transitions. [2020-10-26 00:16:49,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 00:16:49,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-26 00:16:49,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:16:49,607 INFO L225 Difference]: With dead ends: 332 [2020-10-26 00:16:49,608 INFO L226 Difference]: Without dead ends: 262 [2020-10-26 00:16:49,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:16:49,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2020-10-26 00:16:49,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2020-10-26 00:16:49,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2020-10-26 00:16:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 577 transitions. [2020-10-26 00:16:49,619 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 577 transitions. Word has length 16 [2020-10-26 00:16:49,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:16:49,620 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 577 transitions. [2020-10-26 00:16:49,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 00:16:49,620 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 577 transitions. [2020-10-26 00:16:49,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-26 00:16:49,621 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:16:49,622 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:16:49,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 00:16:49,622 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:16:49,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:16:49,623 INFO L82 PathProgramCache]: Analyzing trace with hash -2046124473, now seen corresponding path program 1 times [2020-10-26 00:16:49,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:16:49,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925271651] [2020-10-26 00:16:49,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:16:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:16:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:16:49,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925271651] [2020-10-26 00:16:49,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:16:49,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 00:16:49,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343103919] [2020-10-26 00:16:49,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 00:16:49,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:16:49,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 00:16:49,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:16:49,948 INFO L87 Difference]: Start difference. First operand 262 states and 577 transitions. Second operand 6 states. [2020-10-26 00:16:50,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:16:50,027 INFO L93 Difference]: Finished difference Result 230 states and 512 transitions. [2020-10-26 00:16:50,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 00:16:50,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-26 00:16:50,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:16:50,031 INFO L225 Difference]: With dead ends: 230 [2020-10-26 00:16:50,031 INFO L226 Difference]: Without dead ends: 152 [2020-10-26 00:16:50,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-26 00:16:50,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2020-10-26 00:16:50,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2020-10-26 00:16:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-26 00:16:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 335 transitions. [2020-10-26 00:16:50,038 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 335 transitions. Word has length 19 [2020-10-26 00:16:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:16:50,038 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 335 transitions. [2020-10-26 00:16:50,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 00:16:50,039 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 335 transitions. [2020-10-26 00:16:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-26 00:16:50,040 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:16:50,040 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:16:50,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 00:16:50,040 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:16:50,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:16:50,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1242581581, now seen corresponding path program 1 times [2020-10-26 00:16:50,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:16:50,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022098926] [2020-10-26 00:16:50,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:16:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:16:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-26 00:16:50,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022098926] [2020-10-26 00:16:50,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:16:50,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 00:16:50,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623064919] [2020-10-26 00:16:50,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 00:16:50,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:16:50,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 00:16:50,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-26 00:16:50,306 INFO L87 Difference]: Start difference. First operand 152 states and 335 transitions. Second operand 8 states. [2020-10-26 00:16:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:16:50,593 INFO L93 Difference]: Finished difference Result 185 states and 397 transitions. [2020-10-26 00:16:50,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 00:16:50,594 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-10-26 00:16:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:16:50,595 INFO L225 Difference]: With dead ends: 185 [2020-10-26 00:16:50,596 INFO L226 Difference]: Without dead ends: 98 [2020-10-26 00:16:50,597 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-26 00:16:50,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-10-26 00:16:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-10-26 00:16:50,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-10-26 00:16:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 187 transitions. [2020-10-26 00:16:50,603 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 187 transitions. Word has length 23 [2020-10-26 00:16:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:16:50,603 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 187 transitions. [2020-10-26 00:16:50,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 00:16:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 187 transitions. [2020-10-26 00:16:50,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-26 00:16:50,604 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:16:50,604 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:16:50,605 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 00:16:50,605 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:16:50,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:16:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1624795635, now seen corresponding path program 2 times [2020-10-26 00:16:50,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:16:50,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481678240] [2020-10-26 00:16:50,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:16:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 00:16:50,700 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 00:16:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 00:16:50,758 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 00:16:50,801 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 00:16:50,802 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 00:16:50,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 00:16:50,837 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-10-26 00:16:50,837 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [744] [2020-10-26 00:16:50,839 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-10-26 00:16:50,839 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,839 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-10-26 00:16:50,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,840 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-10-26 00:16:50,840 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,840 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-10-26 00:16:50,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,841 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-10-26 00:16:50,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,841 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-10-26 00:16:50,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,842 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-10-26 00:16:50,843 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,843 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-10-26 00:16:50,843 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,843 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-10-26 00:16:50,844 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,844 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-10-26 00:16:50,844 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,844 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-10-26 00:16:50,844 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,845 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-10-26 00:16:50,845 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,845 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-10-26 00:16:50,845 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,845 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-10-26 00:16:50,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,846 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-10-26 00:16:50,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,846 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-10-26 00:16:50,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,847 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-10-26 00:16:50,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,847 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-10-26 00:16:50,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,848 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-10-26 00:16:50,848 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,848 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-10-26 00:16:50,848 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,849 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-10-26 00:16:50,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,849 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-10-26 00:16:50,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,849 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-10-26 00:16:50,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,850 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-10-26 00:16:50,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,850 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-10-26 00:16:50,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,851 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-10-26 00:16:50,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,851 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-10-26 00:16:50,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,851 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-10-26 00:16:50,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,852 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-10-26 00:16:50,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,852 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-10-26 00:16:50,853 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,853 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-10-26 00:16:50,853 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,853 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-10-26 00:16:50,853 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,854 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-10-26 00:16:50,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,854 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-10-26 00:16:50,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,855 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-10-26 00:16:50,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,855 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-10-26 00:16:50,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,856 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-10-26 00:16:50,856 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,856 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-10-26 00:16:50,856 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 12:16:50 BasicIcfg [2020-10-26 00:16:50,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 00:16:50,920 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 00:16:50,920 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 00:16:50,920 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 00:16:50,921 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:16:41" (3/4) ... [2020-10-26 00:16:50,924 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-26 00:16:50,941 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-10-26 00:16:50,941 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [744] [2020-10-26 00:16:50,942 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-10-26 00:16:50,942 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,942 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-10-26 00:16:50,942 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,943 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-10-26 00:16:50,943 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,943 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-10-26 00:16:50,943 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,943 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-10-26 00:16:50,943 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,944 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-10-26 00:16:50,944 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,944 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-10-26 00:16:50,945 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,945 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-10-26 00:16:50,945 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,945 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-10-26 00:16:50,945 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,946 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-10-26 00:16:50,946 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,946 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-10-26 00:16:50,946 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,946 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-10-26 00:16:50,946 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,947 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-10-26 00:16:50,947 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,947 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-10-26 00:16:50,947 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,947 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-10-26 00:16:50,947 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,948 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-10-26 00:16:50,948 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,948 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-10-26 00:16:50,948 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,948 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-10-26 00:16:50,948 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,949 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-10-26 00:16:50,949 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,949 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-10-26 00:16:50,949 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,949 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-10-26 00:16:50,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,950 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-10-26 00:16:50,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,950 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-10-26 00:16:50,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,950 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-10-26 00:16:50,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,951 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-10-26 00:16:50,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,951 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-10-26 00:16:50,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,952 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-10-26 00:16:50,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,952 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-10-26 00:16:50,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,952 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-10-26 00:16:50,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,953 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-10-26 00:16:50,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,953 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-10-26 00:16:50,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,953 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-10-26 00:16:50,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,954 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-10-26 00:16:50,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,954 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-10-26 00:16:50,954 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,954 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-10-26 00:16:50,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,955 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-10-26 00:16:50,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,955 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-10-26 00:16:50,955 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:50,955 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-10-26 00:16:50,956 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:16:51,090 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 00:16:51,091 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 00:16:51,093 INFO L168 Benchmark]: Toolchain (without parser) took 13680.18 ms. Allocated memory was 41.9 MB in the beginning and 207.6 MB in the end (delta: 165.7 MB). Free memory was 26.1 MB in the beginning and 150.7 MB in the end (delta: -124.6 MB). Peak memory consumption was 40.1 MB. Max. memory is 16.1 GB. [2020-10-26 00:16:51,093 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 41.9 MB. Free memory was 20.7 MB in the beginning and 20.6 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 00:16:51,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 912.88 ms. Allocated memory was 41.9 MB in the beginning and 54.5 MB in the end (delta: 12.6 MB). Free memory was 25.4 MB in the beginning and 27.2 MB in the end (delta: -1.9 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. [2020-10-26 00:16:51,094 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.86 ms. Allocated memory is still 54.5 MB. Free memory was 27.2 MB in the beginning and 24.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 00:16:51,095 INFO L168 Benchmark]: Boogie Preprocessor took 70.86 ms. Allocated memory is still 54.5 MB. Free memory was 24.8 MB in the beginning and 35.9 MB in the end (delta: -11.2 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2020-10-26 00:16:51,095 INFO L168 Benchmark]: RCFGBuilder took 2932.10 ms. Allocated memory was 54.5 MB in the beginning and 81.8 MB in the end (delta: 27.3 MB). Free memory was 35.9 MB in the beginning and 35.7 MB in the end (delta: 233.0 kB). Peak memory consumption was 36.4 MB. Max. memory is 16.1 GB. [2020-10-26 00:16:51,096 INFO L168 Benchmark]: TraceAbstraction took 9502.88 ms. Allocated memory was 81.8 MB in the beginning and 207.6 MB in the end (delta: 125.8 MB). Free memory was 35.7 MB in the beginning and 171.7 MB in the end (delta: -136.0 MB). Peak memory consumption was 101.9 MB. Max. memory is 16.1 GB. [2020-10-26 00:16:51,096 INFO L168 Benchmark]: Witness Printer took 170.97 ms. Allocated memory is still 207.6 MB. Free memory was 171.7 MB in the beginning and 150.7 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-10-26 00:16:51,099 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.31 ms. Allocated memory is still 41.9 MB. Free memory was 20.7 MB in the beginning and 20.6 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 912.88 ms. Allocated memory was 41.9 MB in the beginning and 54.5 MB in the end (delta: 12.6 MB). Free memory was 25.4 MB in the beginning and 27.2 MB in the end (delta: -1.9 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 71.86 ms. Allocated memory is still 54.5 MB. Free memory was 27.2 MB in the beginning and 24.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 70.86 ms. Allocated memory is still 54.5 MB. Free memory was 24.8 MB in the beginning and 35.9 MB in the end (delta: -11.2 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2932.10 ms. Allocated memory was 54.5 MB in the beginning and 81.8 MB in the end (delta: 27.3 MB). Free memory was 35.9 MB in the beginning and 35.7 MB in the end (delta: 233.0 kB). Peak memory consumption was 36.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9502.88 ms. Allocated memory was 81.8 MB in the beginning and 207.6 MB in the end (delta: 125.8 MB). Free memory was 35.7 MB in the beginning and 171.7 MB in the end (delta: -136.0 MB). Peak memory consumption was 101.9 MB. Max. memory is 16.1 GB. * Witness Printer took 170.97 ms. Allocated memory is still 207.6 MB. Free memory was 171.7 MB in the beginning and 150.7 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 1416 VarBasedMoverChecksPositive, 78 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 50 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 203 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.2s, 111 PlacesBefore, 38 PlacesAfterwards, 104 TransitionsBefore, 29 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 92 TotalNumberOfCompositions, 5828 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L723] 0 int z = 0; [L724] 0 _Bool z$flush_delayed; [L725] 0 int z$mem_tmp; [L726] 0 _Bool z$r_buff0_thd0; [L727] 0 _Bool z$r_buff0_thd1; [L728] 0 _Bool z$r_buff0_thd2; [L729] 0 _Bool z$r_buff0_thd3; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$read_delayed; [L735] 0 int *z$read_delayed_var; [L736] 0 int z$w_buff0; [L737] 0 _Bool z$w_buff0_used; [L738] 0 int z$w_buff1; [L739] 0 _Bool z$w_buff1_used; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L838] 0 pthread_t t497; [L839] FCALL, FORK 0 pthread_create(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff1 = z$w_buff0 [L746] 1 z$w_buff0 = 1 [L747] 1 z$w_buff1_used = z$w_buff0_used [L748] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L750] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L751] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L752] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L753] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L754] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t498; [L841] FCALL, FORK 0 pthread_create(&t498, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L780] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L781] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L782] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L783] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L784] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L842] 0 pthread_t t499; [L843] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 z$flush_delayed = weak$$choice2 [L803] 3 z$mem_tmp = z [L804] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L804] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L805] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L805] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L805] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0 [L805] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L805] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L805] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L806] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L807] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L807] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L807] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L807] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L808] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L808] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L808] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L808] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L809] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L810] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L810] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 __unbuffered_p2_EBX = z [L812] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L812] 3 z = z$flush_delayed ? z$mem_tmp : z [L813] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L819] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L820] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L820] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L760] EXPR 1 z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L760] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L761] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L762] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L763] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L764] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L823] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L825] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L856] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix019_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.2s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 258 SDtfs, 264 SDslu, 488 SDs, 0 SdLazy, 179 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1154occurred 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: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 42 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 104 ConstructedInterpolants, 0 QuantifiedInterpolants, 8527 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...